Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference18 articles.
1. The growth range equivalence problem for DOL systems is decidable;Berstel,1976
2. The unsolvability of the equality problem for sentential forms of context-free languages;Blattner;J. Comput. System Sci.,1973
3. The decidability of the equivalence problem for DOL systems;Čulik;Inform. Contr.,1977
4. Elementary homomorphisms and a solution of the DOL sequence equivalence problem;Ehrenfeucht;Theoret. Comput. Sci.,1978
5. Developmental Systems and Languages;Herman,1975
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lindenmayer Systems;Monographs in Theoretical Computer Science;2009
2. The language equivalence problem for HD0L systems having D0L growths;Theoretical Computer Science;2005-01
3. The Equivalence Problem for DF0L Languages and Power Series;Journal of Computer and System Sciences;2002-09
4. On D0L power series;Theoretical Computer Science;2000-08
5. L Systems;Handbook of Formal Languages;1997