Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Albert, M.H. & Lawrence, J.: A proof of Ehrenfeucht’s conjecture. Theoret. Comput. Sci., to appear
2. Berstel, J. & Nielsen, M.: The growth range equivalence problem for DOL systems is decidable. In Automata, Languages, Development (A. Lindenmayer & G. Rozenberg, eds.). North-Holland. Amsterdam (1976), 161–178
3. Culik, K. II & Karhumäki, J.: Systems of equations over a free monoid and Ehrenfeucht conjecture. Discrete Math. 43 (1983), 139–154
4. Ehrenfeucht, A. & Rozenberg, G.: On a bound for the DOL sequence equivalence problem. Theoret. Comput. Sci. 12 (1980), 339–342
5. Gronau, H.-D.O.F. & Steffen, G.: A problem of L system interest. Math. Nachr. 99 (1980). 29–31
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Equivalence Problems for Tree Transducers: A Brief Survey;Electronic Proceedings in Theoretical Computer Science;2014-05-21
2. D0L sequence equivalence is inPfor fixed alphabets;RAIRO - Theoretical Informatics and Applications;2007-12-13
3. A new bound for the D0L sequence equivalence problem;Acta Informatica;2006-10-20