On test sets and the Ehrenfeucht conjecture
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.
KeywordsAlgebraic System Finite Subset Equivalence Problem Inclusion Problem Finite System
Unable to display preview. Download preview PDF.
- 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).Google Scholar
- 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).Google Scholar
- 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).Google Scholar
- Culik, K. II and Karhumäki, J., On the Ehrenfeucht Conjecture for DOL languages, R.A.I.R.O. Theoretical Informatics (to appear).Google Scholar
- 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).Google Scholar
- Karpinski, M., ed., New Scottish Book of Problems, in preparation.Google Scholar
- Perrin, D., Combinatorics on words, (Addison-Wesley, Reading, Massachusetts, to appear).Google Scholar