International Colloquium on Automata, Languages, and Programming

ICALP 1982: Automata, Languages and Programming pp 339-347 | Cite as

On the equivalence problem for binary DOL systems

• Authors
• Authors and affiliations

• Juhani Karhumäki

Conference paper

First Online: 22 October 2005

• 80 Downloads

Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

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.

Keywords

Equivalence Problem Correct Ratio Binary Case Free Monoid Finite Alphabet 

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

References

1. Culik, K. II and Fris, I. (1977), The decidability of the equivalence problem for DOL-systems, Inform. Contr. 35, 20–39.MathSciNetCrossRefGoogle Scholar
2. Culik, K. II and Richier, J.L. (1979), Homomorphism equivalence on ETOL languages, Intern. J. Computer Math. 7, 43–51.MathSciNetCrossRefGoogle Scholar
3. Culik, K. II and Salomaa, A. (1979), On the decidability of homomorphism equivalence for languages, JCSS 17, 163–175.MathSciNetzbMATHGoogle Scholar
4. 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.Google Scholar
5. Ehrenfeucht, A. and Rozenberg, G. (1978), Elementary homomorphisms and a solution to the DOL sequence equivalence problem, Theoret. Comput. Sci. 17, 169–183.MathSciNetCrossRefGoogle Scholar
6. Ehrenfeucht, A. and Rozenberg, G. (1980), On a bound for the DOL sequence equivalence problem, Theoret. Comput. Sci. 12, 339–342.MathSciNetCrossRefGoogle Scholar
7. Harrison, M. (1978), “Introduction to Formal Language Theory”, Addison-Wesley, Reading.zbMATHGoogle Scholar
8. Nielsen, M. (1974), On the decidability of some equivalence problems for DOL systems, Inform. Contr. 25, 166–193.MathSciNetCrossRefGoogle Scholar
9. Rozenberg, G. (1972), The equivalence problem for deterministic TOL systems is undecidable, Inform. Process. Lett. 1, 201–204.CrossRefGoogle Scholar
10. Rozenberg, G. and Salomaa, A. (1980), “The Mathematical Theory of L Systems”, Academic Press, New York.zbMATHGoogle Scholar
11. Salomaa, A. (1978a), Equality sets for homomorphisms of free monoids, Acta Cybernetica 4, 127–139.MathSciNetzbMATHGoogle Scholar
12. Salomaa, A. (1978b), DOL equivalence: The problem of iterated morphisms, E.A.T.C.S. Bulletin 4, 5–12.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

• Juhani Karhumäki
  • 1

1. 1.Department of MathematicsUniversity of TurkuTurkuFinland