Abstract
The Ehrenfeucht Conjecture on test sets states the following: Each language L over some finite alphabet contains a finite subset F (a "test set") such that for each pair (g,h) of homomorphisms it holds g(x) = h(x) for all × in F if and only if g(x) = h(x) for all × in L. In this paper we investigate the connections of this conjecture to its dual form where finite representation for any set of pairs of homomorphisms is stated. We also point out similarities and differences of these conjectures to well-known constructions of bases of linear vector-spaces.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J. D.: "The Theory of Parsing, Translation and Compiling", vol. 1, Prentice-Hall (1972)
Albert, J., Culik II, K., Karhumäki, J.: Test sets for contextfree languages and systems of equations over a free monoid, Inf. and Control 52, 2, 172–186 (1982)
Albert, J., Wood, D.: Checking sets, test sets, rich languages and commutatively closed languages, J. Comp. System Sci. 26, 1, 82–91 (1983)
Albert, J.: On test sets, checking sets, maximal extensions and their effective constructions, Forschungsbericht 129, Universität Karlsruhe (1983)
Berstel, J.: "Transductions and Context-Free Languages", B.G. Teubner (1979)
Culik II, K.: A purely homomorphic characterization of recursively enumerable sets, J. ACM 26,2, 345–350 (1979)
Culik II, K.: Some decidability results about regular and pushdown translations, Inform. Proc. Letters 8, 5–8 (1979)
Culik II, K.: Homomorphisms: decidability, equality and test sets, in "Formal Language Theory, Perspectives and Open Problems", R. Book ed., Academic Press (1980)
Culik II, K., Karhumäki, J.: Systems of equations over a free monoid and Ehrenfeucht conjecture, 9. ICALP, Aarhus, Lect. Notes in Comp. Sci. 140, Springer Verlag, 128–140 (1982)
Culik II, K., Karhumäki, J.: On the Ehrenfeucht Conjecture for DOL languages, RAIRO, to appear
Culik II, K., Salomaa, A.: On the decidability of homomorphism equivalence for languages, J. Comp. System Sci. 17, 20–39 (1978)
Culik II, K., Salomaa, A.: Test sets and checking words for homomorphism equivalence, J. Comp. System Sci. 20, 379–395 (1980)
Ehrenfeucht, A., Karhumäki, J., Rozenberg, G.: On binary equality languages and a solution to the Ehrenfeucht Conjecture in the binary case, J. of Algebra, to appear
Ehrenfeucht, A., Rozenberg, G., Ruohonen, K.: A morphic representation of complements of recursively enumerable sets, J. ACM 28, 4, 706–714 (1981)
Engelfriet, J., Rozenberg, G.: Fixed point languages, equality languages, and representations of recursively enumerable languages, J. ACM 27, 3, 499–518 (1980)
Harrison, M.A.: "Introduction to Formal Language Theory", Addison-Wesley (1978)
Maon, Y., Yehudai, A.: Test sets for checking morphism equivalence on languages with fair distribution of letters, Technical report, Tel-Aviv University, (1983)
Rozenberg, G., Salomaa, A.: "The Mathematical Theory of L Systems", Academic Press (1980)
Salomaa, A.: "Formal Languages", Academic Press (1973)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albert, J. (1984). On the Ehrenfeucht conjecture on test sets and its dual version. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030297
Download citation
DOI: https://doi.org/10.1007/BFb0030297
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13372-8
Online ISBN: 978-3-540-38929-3
eBook Packages: Springer Book Archive