The set of strings mapped into a submonoid by iterates of a morphism

DOI10.1016/0304-3975(90)90183-IzbMath0694.68050MaRDI QIDQ909479

Tom Head

Publication date: 1990

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

zbMATH Keywords

periodicityregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Morphic congruences and D0L languages

Cites Work

• Unnamed Item
• Regularity of sets of initial strings of periodic D0L-systems
• Periodicity and ultimate periodicity of D0L systems
• Periodic D0L languages
• Bounded D0L languages
• On the periodicity of morphisms on free monoids
• Decidability of periodicity for infinite words

This page was built for publication: The set of strings mapped into a submonoid by iterates of a morphism