Characteristic Sturmian words are extremal for the critical factorization theorem

DOI10.1016/j.tcs.2012.03.012zbMath1263.68122OpenAlexW2083294913MaRDI QIDQ714825

Antonio Restivo, Filippo Mignosi

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.012

zbMATH Keywords

periodicitySturmian wordscombinatorics on wordscritical factorization theorem

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

How to prove that a sequence is not automatic ⋮ Abelian Repetitions in Sturmian Words ⋮ Standard Sturmian words and automata minimization algorithms ⋮ Sequences of words defined by two-way transducers ⋮ A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sturmian graphs and integer representations over numeration systems
• Circular Sturmian words and Hopcroft's algorithm
• On Sturmian graphs
• Burrows-Wheeler transform and Sturmian words
• The smallest automaton recognizing the subwords of a text
• Periodes et repetitions des mots du monoide libre
• Some combinatorial properties of Sturmian words
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• Simple Real-Time Constant-Space String Matching
• Sturmian and Episturmian Words
• Fast Pattern Matching in Strings
• Two-way string-matching
• Rotations of Periodic Strings and Short Superstrings
• Density of Critical Factorizations
• Uniqueness Theorems for Periodic Functions
• Suffix Automata and Standard Sturmian Words
• Sequences with minimal block growth
• Recurrence and periodicity in infinite words from local periods

This page was built for publication: Characteristic Sturmian words are extremal for the critical factorization theorem