Morphic congruences and D0L languages

DOI10.1016/0304-3975(94)00110-3zbMath0938.68712OpenAlexW2081974394MaRDI QIDQ1341732

V. Pereyra

Publication date: 15 June 2000

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00110-3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems ⋮ Dynamical properties of PWD0L systems ⋮ Morphic refinements of nonregular languages ⋮ The class of HDT0L sequences is closed with respect to rational functions ⋮ Language-theoretic aspects of DNA complementarity ⋮ Uni-transitional Watson-Crick D0L systems

Cites Work

• Dynamical properties of PWD0L systems
• The set of strings mapped into a submonoid by iterates of a morphism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item