Prefix-Suffix Square Completion

DOI10.1007/978-3-319-23660-5_13zbMath1335.68189OpenAlexW2270630849MaRDI QIDQ3449365

Florin Manea, Marius Dumitran

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23660-5_13

zbMATH Keywords

infinite wordThue-Morse wordprefix square completionsuffix square completion

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (2)

SQUARE COMPLETION OPERATION OF MAXIMAL SUFFIX IN FIBONACCI WORD ⋮ On the Prefix–Suffix Duplication Reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adjacency preserving transformations of Grassmann spaces
• Extremal words in morphic subshifts
• YANG–MILLS DUALITY AND THE GENERATION PUZZLE
• Bounded Prefix-Suffix Duplication
• Fast Pattern Matching in Strings
• Algorithms on Strings, Trees and Sequences
• Automatic Sequences
• On the axioms of topological electromagnetism
• A new characterization of maximal repetitions by Lyndon trees

This page was built for publication: Prefix-Suffix Square Completion