Abstract
It is shown that to test whether two DOL sequences in the binary case coincide it is enough to test whether four first words of these sequences are the same. The result is optimal.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Culik, K. II and Fris, I. (1977), The decidability of the equivalence problem for DOL-systems, Inform. Contr. 35, 20–39.
Culik, K. II and Richier, J.L. (1979), Homomorphism equivalence on ETOL languages, Intern. J. Computer Math. 7, 43–51.
Culik, K. II and Salomaa, A. (1979), On the decidability of homomorphism equivalence for languages, JCSS 17, 163–175.
Ehrenfeucht, A., Karhumäki, J. and Rozenberg, G. (1981), On binary equality sets and a solution to the Ehrenfeucht Conjecture in the binary case, manuscript.
Ehrenfeucht, A. and Rozenberg, G. (1978), Elementary homomorphisms and a solution to the DOL sequence equivalence problem, Theoret. Comput. Sci. 17, 169–183.
Ehrenfeucht, A. and Rozenberg, G. (1980), On a bound for the DOL sequence equivalence problem, Theoret. Comput. Sci. 12, 339–342.
Harrison, M. (1978), “Introduction to Formal Language Theory”, Addison-Wesley, Reading.
Nielsen, M. (1974), On the decidability of some equivalence problems for DOL systems, Inform. Contr. 25, 166–193.
Rozenberg, G. (1972), The equivalence problem for deterministic TOL systems is undecidable, Inform. Process. Lett. 1, 201–204.
Rozenberg, G. and Salomaa, A. (1980), “The Mathematical Theory of L Systems”, Academic Press, New York.
Salomaa, A. (1978a), Equality sets for homomorphisms of free monoids, Acta Cybernetica 4, 127–139.
Salomaa, A. (1978b), DOL equivalence: The problem of iterated morphisms, E.A.T.C.S. Bulletin 4, 5–12.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karhumäki, J. (1982). On the equivalence problem for binary DOL systems. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012781
Download citation
DOI: https://doi.org/10.1007/BFb0012781
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11576-2
Online ISBN: 978-3-540-39308-5
eBook Packages: Springer Book Archive