The Ehrenfeucht conjecture: An algebra-framework for its proof

DOI10.1016/0304-3975(86)90126-XzbMath0599.20092WikidataQ123011980 ScholiaQ123011980MaRDI QIDQ1080530

Ebbe Thue Poulsen

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Ehrenfeucht conjectureaffine monoidsword semigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

New techniques for proving the decidability of equivalence problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• A proof of Ehrenfeucht's conjecture