Periodic D0L languages

DOI10.1016/0304-3975(86)90023-XzbMath0628.68058MaRDI QIDQ1093376

Barbara Lando, Tom Head

Publication date: 1986

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

zbMATH Keywords

free semigroupsformal languageperiodicity of wordsD0L-systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42)

Related Items (5)

Bounded D0L languages ⋮ The set of strings mapped into a submonoid by iterates of a morphism ⋮ Regularity of sets of initial strings of periodic D0L-systems ⋮ Repetitiveness of languages generated by morphisms ⋮ Periodicity and ultimate periodicity of D0L systems

Cites Work

• Code properties and homomorphisms of DOL systems
• Finite DOL languages and codes
• On the periodicity of morphisms on free monoids
• Decidability of periodicity for infinite words
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Periodic D0L languages