On infinite words obtained by iterating morphisms

DOI10.1016/0304-3975(82)90013-5zbMath0492.68059OpenAlexW2000670348MaRDI QIDQ1168084

Karel II Culik, Arto Salomaa

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90013-5

zbMATH Keywords

omega languagesadherence language equivalence problemalgorithm for the DOL sequence equivalence problemdecidability of the limit language equivalence problem for DOL systemsDTOL languagesDTOL systemsprefix-preserving DOL 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 (20)

Subword topology ⋮ A bound for theω-equivalence problem of polynomial D0L systems ⋮ Properties of infinite words : Recent results ⋮ Iterative devices generating infinite words ⋮ Sur les centres de DOL-langages ⋮ A rewriting of Fife's theorem about overlap-free words ⋮ On properties of edtol and rwdol languages and the constructibility of finite morphic refinements ⋮ A remark on morphic sturmian words ⋮ REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM ⋮ On infinite words generated by polynomial D0L systems ⋮ Topology on words ⋮ On infinite HD0L words having sparse letters ⋮ Decidability of periodicity for infinite words ⋮ Infinite arrays and infinite computations ⋮ Separately continuous algebras ⋮ THE D0L ω-EQUIVALENCE PROBLEM ⋮ Infinite arrays and controlled deterministic table 0L array systems ⋮ On infinite words obtained by selective substitution grammars ⋮ Adherences of DOL languages ⋮ On infinite words determined by L systems

Cites Work

• The ultimate equivalence problem for DOL systems
• The decidability of the dol prefix problem
• The decidability of the equivalence problem for DOL-systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On infinite words obtained by iterating morphisms