Adherences of DOL languages

DOI10.1016/0304-3975(84)90131-2zbMath0587.68069OpenAlexW2059389477MaRDI QIDQ1072713

Tom Head

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90131-2

zbMATH Keywords

adherence equivalence problemauxiliary DOL-systemslimit equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Sur les centres de DOL-langages ⋮ On properties of edtol and rwdol languages and the constructibility of finite morphic refinements ⋮ Topology on words ⋮ On infinite words determined by L systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adherences of languages
• On infinite words obtained by iterating morphisms
• Doubly deterministic tabled OL systems
• Hypercodes in deterministic and slender 0L languages

This page was built for publication: Adherences of DOL languages