Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht

DOI10.1016/0304-3975(85)90137-9zbMath0609.68054OpenAlexW2091781319WikidataQ122965896 ScholiaQ122965896MaRDI QIDQ1087020

Jean-Claude Spehner

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90137-9

zbMATH Keywords

Ehrenfeucht conjecturerational languageentire system of equations over an alphabetshuffle automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Every finitely generated submonoid of a free monoid has a finite Malcev's presentation

Cites Work

• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• Some algorithms on the star operation applied to finite languages
• Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• On binary equality sets and a solution to the test set conjecture in the binary case
• Test sets and checking words for homomorphism equivalence
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• On the decidability of homomorphism equivalence for languages
• Test sets for context free languages and algebraic systems of equations over a free monoid
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht