Pages that link to "Item:Q4630287"
From MaRDI portal
The following pages link to If a DOL language is k-power free then it is circular (Q4630287):
Displaying 19 items.
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- Bispecial factors in circular non-pushy D0L languages (Q442285) (← links)
- An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- On critical exponents in fixed points of non-erasing morphisms (Q880175) (← links)
- Synchronizing delay for binary uniform morphisms (Q906381) (← links)
- Separators in infinite words generated by morphisms. (Q1390860) (← links)
- Repetitiveness of languages generated by morphisms (Q1575438) (← links)
- Some results on \(k\)-power-free morphisms (Q1605332) (← links)
- Periodicity, repetitions, and orbits of an automatic sequence (Q2271417) (← links)
- Characterization of circular D0L-systems (Q2272391) (← links)
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (Q2381820) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
- The subword complexity of fixed points of binary uniform morphisms (Q5055933) (← links)
- Recognizability for sequences of morphisms (Q5235114) (← links)
- On factor graphs of DOL words (Q5954087) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Substitution-dynamics and invariant measures for infinite alphabet-path space (Q6199299) (← links)
- The number of primitive words of unbounded exponent in the language of an HD0L-system is finite (Q6543057) (← links)
