Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference10 articles.
1. Culik II, K.: On the decidability of the sequence equivalence problem for DOL systems. Theoret. Comput. Sci. 3, 75–84 (1977)
2. Culik II, K., Fris, I.: The sequence equivalence problem for DOL systems is decidable. Information and Control 35, 20–39 (1977)
3. Culik II, K.: The decidability of v-local catenativity and of other properties of DOL systems. Information Processing Lett. 7, 33–35 (1978)
4. Culik II, K., Maurer, H.A.: Propagating chain-free normal forms for EOL systems. Information and Control 36, 309–319 (1978)
5. Ehrenfeucht, A., Rozenberg, G.: On simplifications of PDOL systems. Proceedings of a Conference on Theoretical Computer Science, University of Waterloo, Waterloo, Ontario, Canada, August 1977
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The sequence equivalence problem for primitive D0L systems;Journal of Computer and System Sciences;2013-02
2. EQUALITY SETS OF MORPHIC WORD SEQUENCES;International Journal of Foundations of Computer Science;2012-12
3. An n2-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet;Journal of Computer and System Sciences;2005-11
4. Publications of K. Culik;RAIRO - Theoretical Informatics and Applications;1994
5. On the periodicity of morphisms on free monoids;RAIRO - Theoretical Informatics and Applications;1986