Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. The unsolvability of the equality problem for setential forms of context-free grammars;Blattner;J. Comput. System Sci.,1973
2. On some families of languages related to developmental systems;Culik;Internl. J. Comput. Math.,1974
3. K. Culik II and J. Opatrný, Macro OL-systems, Internl. J. Comput. Math (A) 5, to appear.
4. G. T. Herman, Closure properties of some families of languages associated with biological systems, Information and Control, to appear.
5. Developmental Systems and Languages;Herman,1974
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Arto Salomaa: Mathematician, Computer Scientist, and Teacher;2019
2. A Survey on Decidable Equivalence Problems for Tree Transducers;International Journal of Foundations of Computer Science;2015-12
3. Equivalence Problems for Tree Transducers: A Brief Survey;Electronic Proceedings in Theoretical Computer Science;2014-05-21
4. THE D0L ω-EQUIVALENCE PROBLEM;International Journal of Foundations of Computer Science;2007-02
5. REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM;International Journal of Foundations of Computer Science;2002-10