Abstract
Ehrenfeucht conjectured that each language over a finite alphabet σ possesses a test set, that is a finite subset F of L such that any two morphisms on σ* agreeing on each string of F also agree on each string of L. We give a sufficient condition for a language L to guarantee that it has a test set. We also show that the Ehrenfeucht conjecture holds true if and only if every (infinite) system of equations (with finite number of variables) over a finitely generated free, monoid has an equivalent finite subsystem. The equivalence and the inclusion problems for finite systems of equations are shown to be decidable. As an application we derive a result that for DOL languages the existence of a test set implies its effective existence. Consequently, the validity of the Ehrenfeucht conjecture for DOL languages implies the decidability of the HDOL sequence equivalence problem. Finally, we show that the Ehrenfeucht conjecture holds true for so-called positive DOL languages.
This work was carried out when the second author visited at the University of Waterloo and it was supported by Natural Science and Engineering Research Council of Canada, Grant A 7403.
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
Albert, J., Culik, K. II and Karhumäki, J., Test sets for context-free languages and algebraic systems of equations over a free monoid, Res. Rep. CS-81-16, Dept. of Comp. Science, University of Waterloo, Canada (1981).
Berstel, J., Transductions and context-free languages, (B.G. Teubner, Stuttgart, 1979).
Berstel, J., Perrin, D., Perrot, J.F. et Restivo, A., Sur le théorème du défaut, J. of Algebra 60, 169–180 (1979).
Culik, K. II, Homomorphisms: Decidability, Equality and Test sets, in: R. Book, ed., Formal Language Theory, Perspectives and Open Problems, (Academic Press, New York 1980).
Culik, K. II and Karhumäki, J., On the equality sets for homomorphisms on free monoids with two generators, R.A.I.R.O. Theoretical Informatics 14, 349–369 (1980).
Culik, K. II and Karhumäki, J., Systems of equations over a free monoid and Ehrenfeucht conjecture, Res. Rep. CS-81-15, Dept. of Comp. Science, University of Waterloo, Canada (1981).
Culik, K. II and Karhumäki, J., On the Ehrenfeucht Conjecture for DOL languages, R.A.I.R.O. Theoretical Informatics (to appear).
Culik, K. II and Salomaa, A., On the decidability of homomorphism equivalence for languages, JCSS 17, 163–175 (1978).
Culik, K. II and Salomaa, A., Test sets and checking words for homomorphism equivalence, JCSS 19, 379–395 (1980).
Ehrenfeucht, A., Karhumäki, J. and Rozenberg, G., On binary equality languages and a solution to the Ehrenfeucht conjecture in the binary case, manuscript (1981).
Ehrenfeucht, A. and Rozenberg, G., Simplification of homomorphisms, Information and Control 38, 289–309 (1978).
Eilenberg, S. and Schützenberger, M.P., Rational sets in commutative monoids, J. of Algebra 13, 173–191 (1969).
Harrison, M., Introduction to Formal Language Theory, (Addison-Wesley, Reading, Massachusetts, 1978).
Karpinski, M., ed., New Scottish Book of Problems, in preparation.
Makanin, G.S., The problem of solvability of equations in a free semigroup (in Russian), Matematiceskij Sbornik 103, 148–236 (1977).
Perrin, D., Combinatorics on words, (Addison-Wesley, Reading, Massachusetts, to appear).
Rozenberg, G. and Salomaa, A., The Mathematical Theory of L systems, (Academic Press, New York, 1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Culik, K., Karhumäki, J. (1982). On test sets and the Ehrenfeucht conjecture. 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/BFb0012763
Download citation
DOI: https://doi.org/10.1007/BFb0012763
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