The following pages link to (Q3835038):
Displaying 13 items.
- An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
- On stabilizers of infinite words (Q930926) (← links)
- On the conjugation of standard morphisms (Q1128481) (← links)
- Fibonacci morphisms and Sturmian words (Q1177169) (← links)
- Power of words and recognizability of fixpoints of a substitution (Q1193907) (← links)
- On the subword equivalence problem for morphic words (Q1363770) (← links)
- On the factors of automatic words (Q1392016) (← links)
- Repetitiveness of languages generated by morphisms (Q1575438) (← links)
- Morphic words and equidistributed sequences (Q2283040) (← links)
- Substitutions with cofinal fixed points (Q2372785) (← links)
- Mirror substitutions and palindromic sequences (Q2465631) (← links)
- Periodicity Problem of Substitutions over Ternary Alphabets (Q3537495) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
