Pages that link to "Item:Q491624"
From MaRDI portal
The following pages link to An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624):
Displaying 8 items.
- Synchronizing delay for binary uniform morphisms (Q906381) (← links)
- Substitutive systems and a finitary version of Cobham's theorem (Q2064759) (← links)
- Lie complexity of words (Q2163386) (← links)
- Characterization of circular D0L-systems (Q2272391) (← links)
- Morphic words and equidistributed sequences (Q2283040) (← links)
- Palindromic length of words and morphisms in class \(\mathcal{P}\) (Q2420618) (← links)
- Topological invariants for words of linear factor complexity (Q2672961) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
