Systems of equations over a free monoid and Ehrenfeucht's conjecture

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

Cites work

scientific article; zbMATH DE number 3660804 (Why is no real title available?)
scientific article; zbMATH DE number 3710436 (Why is no real title available?)
scientific article; zbMATH DE number 3750326 (Why is no real title available?)
scientific article; zbMATH DE number 3569855 (Why is no real title available?)
scientific article; zbMATH DE number 3577484 (Why is no real title available?)
scientific article; zbMATH DE number 3639163 (Why is no real title available?)
On the decidability of homomorphism equivalence for languages
Simplifications of homomorphisms
Test sets and checking words for homomorphism equivalence
The decidability of the dol prefix problem
The decidability of the equivalence problem for DOL-systems

Cited in

(39)

On binary equality sets and a solution to the test set conjecture in the binary case
A note on decidability questions on presentations of word semigroups
On the equivalence of some transductions involving letter to letter morphisms on regular languages
One-variable word equations and three-variable constant-free word equations
Finite transducers and rational transductions
Inverse morphic equivalence on languages
On test sets for checking morphism equivalence on languages with fair distribution of letters
On the size of independent systems of equations in semigroups
Multiple constraints on three and four words
Test sets for morphisms with bounded delay
Systems of word equations, polynomials and linear algebra: a new approach
The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
The descending chain condition on solution sets for systems of equations in groups
Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\)
New techniques for proving the decidability of equivalence problem
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
An optimal bound on the solution sets of one-variable word equations and its consequences
Identities and transductions
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
On the independence of equations in three variables.
Compactness of systems of equations in semigroups
On maximal chains of systems of word equations
An optimal bound on the solution sets of one-variable word equations and its consequences
On the equivalence problem for deterministic multitape automata and transducers
The equivalence of finite valued transducers (on HDT0L languages) is decidable
Equations over finite sets of words and equivalence problems in automata theory
scientific article; zbMATH DE number 3866597 (Why is no real title available?)
A compactness property of the \(k\)-abelian monoids
A proof of Ehrenfeucht's conjecture
Finite degrees of ambiguity in pattern languages
Loops in automata and HDTOL relations
The expressibility of languages and relations by word equations
The Equivalence Problem of Finite Substitutions on ab*c, with Applications
Multiplicities: A deterministic view of nondeterminism
On the size of independent systems of equations in semigroups
Synchronizable deterministic pushdown automata and the decidability of their equivalence
Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht
On the defect theorem and simplifiability
ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS

This page was built for publication: Systems of equations over a free monoid and Ehrenfeucht's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786545)