Pages that link to "Item:Q714825"
From MaRDI portal
The following pages link to Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825):
Displaying 7 items.
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words (Q544878) (← links)
- Sequences of words defined by two-way transducers (Q728270) (← links)
- How to prove that a sequence is not automatic (Q2121041) (← links)
- A new complexity function for words based on periodicity (Q2842028) (← links)
- Critical factorisation in square-free words (Q5066974) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)