Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre
From MaRDI portal
Publication:797700
DOI10.1016/0012-365X(84)90187-0zbMath0545.20046MaRDI QIDQ797700
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Systèmes entiers d'équations sur un alphabet fini et conjecture d'Ehrenfeucht ⋮ Makanin's algorithm is not primitive recursive ⋮ Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general ⋮ Solving word equations ⋮ Solving word equations ⋮ On equality up-to constraints over finite trees, context unification, and one-step rewriting
Cites Work
- Sur le théorème du defaut
- Finding patterns common to a set of strings
- Sur la détermination du rang d'une équation dans le monoide libre
- Equations in free semigroups
- Equations in Free Groups
- ON THE RANK OF COEFFICIENTLESS EQUATIONS IN FOUR UNKNOWNS IN A FREE SEMIGROUP
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
