Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. The ultimate equivalence problem for DOL systems;Culik;Acta Informat.,1976
2. Homomorphisms: decidability, equality and test sets;Culik,1979
3. The sequence equivalence problem for DOL systems is decidable;Culik;Information and Control,1977
4. The decidability of the DOL prefix problem;Linna;Internat. J. Comput. Math.,1977
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On infinite words determined by L systems;Theoretical Computer Science;2015-08
2. On Infinite Words Determined by L Systems;Lecture Notes in Computer Science;2013
3. Topology on words;Theoretical Computer Science;2009-05
4. THE D0L ω-EQUIVALENCE PROBLEM;International Journal of Foundations of Computer Science;2007-02
5. On infinite HD0L words having sparse letters;International Journal of Computer Mathematics;2004-02