Cancellation and periodicity properties of iterated morphisms

DOI10.1016/j.tcs.2007.10.030zbMath1133.68037OpenAlexW2080008992MaRDI QIDQ2474225

Juha Honkala

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.030

zbMATH Keywords

periodicityiterated morphismD0L system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

An algorithm for enumerating all infinite repetitions in a D0L-system, On the simplification of infinite morphic words

Cites Work

• Unnamed Item
• Unnamed Item
• The Maximum Order of an Element of a Finite Symmetric Group
• On the periodicity of morphisms on free monoids
• Simplifications of homomorphisms
• Automatic Sequences
• Decidability of periodicity for infinite words