Recommendations
Cites work
- scientific article; zbMATH DE number 3577484 (Why is no real title available?)
- scientific article; zbMATH DE number 1223734 (Why is no real title available?)
- scientific article; zbMATH DE number 1346496 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 826052 (Why is no real title available?)
- Complexity of Makanin's algorithm
- Equations in words: An algorithmic contribution
- Satisfiability of word equations with constants is in NEXPTIME
- Two-variable word equations
Cited in
(15)- Two-variable word equations
- Unification modulo lists with reverse relation with certain word equations
- scientific article; zbMATH DE number 1929939 (Why is no real title available?)
- Efficient solving of the word equations in one variable
- One-variable word equations and three-variable constant-free word equations
- Mathematical Foundations of Computer Science 2003
- 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
- An optimal bound on the solution sets of one-variable word equations and its consequences
- One-variable word equations in linear time
- What is essential unification?
- Word Equations with One Unknown
- One-variable word equations in linear time
- Word equations with one unknown
- On the complexity of solving restricted word equations
This page was built for publication: On word equations in one variable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547296)
