×

A proof of Ehrenfeucht’s conjecture. (English) Zbl 0602.68066

Ehrenfeucht’s conjecture states that each subset S of a finitely generated free monoid has a finite subset T such that if two endomorphisms of the monoid agree on T, then they agree on S. It is the purpose of this note to verify the conjecture.

MSC:

68Q45 Formal languages and automata
20M05 Free semigroups, generators and relations, word problems
20M35 Semigroups in automata theory, linguistics, etc.
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] M.H. Albert and J. Lawrence, The descending chain condition on solution sets for systems of equations in groups, Proc. Edinburgh Math. Soc., to appear. · Zbl 0584.20027
[2] Baumslag, G.; Roitberg, Y., Groups with free 2-generator subsemigroups, Semigroup forum, 25, 135-143, (1982) · Zbl 0494.20014
[3] Culik, K.; Karhumäki, J., Systems of equations over a free monoid and Ehrenfeucht’s conjecture, Discrete math., 43, 139-153, (1983) · Zbl 0528.68057
[4] Culik, K.; Salomaa, A., Test sets and checking words for homomorphism equivalence, J. comput. system sci., 20, 379-395, (1980) · Zbl 0451.68046
[5] Hall, P., Finiteness conditions for soluble groups, (), 419-436, (3) · Zbl 0056.25603
[6] Karhumäki, J., The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids, Theoret. comput. sci., 29, 285-308, (1984) · Zbl 0546.68060
[7] Mal’cev, A.I., Nilpotent semigroups, Ivanov. GoS. ped. last. ucen zap. fiz.-mat. nauki, 4, 107-111, (1953)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.