Towards parametrizing word equations
From MaRDI portal
Publication:4331050
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1346502 (Why is no real title available?)
- scientific article; zbMATH DE number 3407957 (Why is no real title available?)
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- Equations in free semigroups
- Minimal and complete word unification
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
Cited in
(10)- scientific article; zbMATH DE number 6678923 (Why is no real title available?)
- On general solution of word equations
- Equations in words: An algorithmic contribution
- Regular patterns in second-order unification
- scientific article; zbMATH DE number 522840 (Why is no real title available?)
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof
- Mathematical Foundations of Computer Science 2004
- Makanin's algorithm for word equations-two improvements and a generalization
- Parametrizability by regular expressions for equations on words
This page was built for publication: Towards parametrizing word equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331050)