On the decidability of the sequence equivalence problem for DOL-systems
- 31 October 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 3 (1), 75-84
- https://doi.org/10.1016/0304-3975(76)90066-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Mathematical Theory of L SystemsPublished by Springer Nature ,1976
- On the decidability of some equivalence problems for DOL-systemsInformation and Control, 1974
- Closure properties of some families of languages associated with biological systemsInformation and Control, 1974
- Free groups in Lindenmayer systemsPublished by Springer Nature ,1974
- On some families of languages related to developmental systemsInternational Journal of Computer Mathematics, 1974
- Extension of tabled 0L-systems and languagesInternational Journal of Parallel Programming, 1973
- Integral sequential word functions and growth equivalence of lindenmayer systemsInformation and Control, 1973
- The unsolvability of the equality problem for sentential forms of context-free grammarsJournal of Computer and System Sciences, 1973
- Developmental systems without cellular interactions, their languages and grammarsJournal of Theoretical Biology, 1971