Pages that link to "Item:Q3341931"
From MaRDI portal
The following pages link to Repetition of subwords in DOL languages (Q3341931):
Displaying 18 items.
- Bispecial factors in circular non-pushy D0L languages (Q442285) (← links)
- An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
- On critical exponents in fixed points of non-erasing morphisms (Q880175) (← links)
- Synchronizing delay for binary uniform morphisms (Q906381) (← links)
- Repetition-free words (Q1078338) (← links)
- On the subword equivalence problem for morphic words (Q1363770) (← links)
- Languages, D0L-systems, sets of curves, and surface automorphisms. (Q1400580) (← links)
- Repetitiveness of languages generated by morphisms (Q1575438) (← links)
- Some remarks about stabilizers (Q2271432) (← links)
- Characterization of circular D0L-systems (Q2272391) (← links)
- Periodicity of morphic words (Q2515198) (← links)
- On Critical exponents in fixed points of<i>k</i>-uniform binary morphisms (Q3549288) (← links)
- ON UNIFORMLY RECURRENT MORPHIC SEQUENCES (Q3646174) (← links)
- Infinite interval exchange transformations from shifts (Q4600266) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- Generalized Sturmian languages (Q4645190) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
- The number of primitive words of unbounded exponent in the language of an HD0L-system is finite (Q6543057) (← links)
