On the decidability of the sequence equivalence problem for DOL-systems

DOI10.1016/0304-3975(76)90066-9zbMath0352.68103OpenAlexW2021080624MaRDI QIDQ1235985

Karel II Culik

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90066-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Genetics and epigenetics (92D10)

Related Items (8)

Balance of many-valued transductions and equivalence problems ⋮ Unnamed Item ⋮ REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM ⋮ Lindenmayer grammars and symbolic testing ⋮ A Survey on Decidable Equivalence Problems for Tree Transducers ⋮ On the decidability of homomorphism equivalence for languages ⋮ Homomorphism equivalence on etol languages† ⋮ THE D0L ω-EQUIVALENCE PROBLEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The unsolvability of the equality problem for sentential forms of context-free grammars
• Extension of tabled 0L-systems and languages
• On some families of languages related to developmental systems
• Closure properties of some families of languages associated with biological systems
• On the decidability of some equivalence problems for DOL-systems
• Integral sequential word functions and growth equivalence of lindenmayer systems

This page was built for publication: On the decidability of the sequence equivalence problem for DOL-systems