On the decidability of the sequence equivalence problem for DOL-systems
From MaRDI portal
Publication:1235985
DOI10.1016/0304-3975(76)90066-9zbMath0352.68103MaRDI QIDQ1235985
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
Related Items
Balance of many-valued transductions and equivalence problems, Lindenmayer grammars and symbolic testing, On the decidability of homomorphism equivalence for languages, REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM, Unnamed Item, THE D0L ω-EQUIVALENCE PROBLEM, Homomorphism equivalence on etol languages†
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