Pages that link to "Item:Q3747748"
From MaRDI portal
The following pages link to On the periodicity of morphisms on free monoids (Q3747748):
Displaying 27 items.
- Presentations of Schützenberger groups of minimal subshifts. (Q375868) (← links)
- An algorithm for enumerating all infinite repetitions in a D0L-system (Q491624) (← links)
- Relations on words (Q505060) (← links)
- Regularity of sets of initial strings of periodic D0L-systems (Q580989) (← links)
- Periodicity and ultimate periodicity of D0L systems (Q807022) (← links)
- The set of strings mapped into a submonoid by iterates of a morphism (Q909479) (← links)
- On the simplification of infinite morphic words (Q1006088) (← links)
- Periodic D0L languages (Q1093376) (← links)
- Bounded D0L languages (Q1098317) (← links)
- Prefixes of infinite words and ambiguous context-free languages (Q1108044) (← links)
- On D0L systems with immigration (Q1314370) (← links)
- On the subword equivalence problem for morphic words (Q1363770) (← links)
- On the factors of automatic words (Q1392016) (← links)
- On D0L power series (Q1575708) (← links)
- Cancellation and periodicity properties of iterated morphisms (Q2474225) (← links)
- Periodicity of morphic words (Q2515198) (← links)
- Coding of substitution dynamical systems as shifts of finite type (Q2805069) (← links)
- DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES (Q2841990) (← links)
- Periodicity Problem of Substitutions over Ternary Alphabets (Q3537495) (← links)
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS (Q3643584) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- Asymptotic behaviour of bi-infinite words (Q4825387) (← links)
- Automatic sequences of rank two (Q5044415) (← links)
- Properties of infinite words : Recent results (Q5096141) (← links)
- Iterative devices generating infinite words (Q5096808) (← links)
- Iterative algebras. (Q5962977) (← links)
- Decidable problems in substitution shifts (Q6126479) (← links)
