One-Variable Word Equations and Three-Variable Constant-Free Word Equations
From MaRDI portal
Publication:4683239
DOI10.1142/S0129054118420121zbMath1473.68131WikidataQ129400473 ScholiaQ129400473MaRDI QIDQ4683239
Publication date: 20 September 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (6)
Equations over the \(k\)-binomial monoids ⋮ Word equations in the context of string solving ⋮ A compactness property of the \(k\)-abelian monoids ⋮ On the Solution Sets of Entire Systems of Word Equations ⋮ Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\) ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
Cites Work
- One-variable word equations in linear time
- On word equations in one variable
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- A proof of Ehrenfeucht's conjecture
- On the independence of equations in three variables.
- Systems of word equations, polynomials and linear algebra: a new approach
- On F-semigroups with three generators
- Algebraic properties of word equations
- On maximal chains of systems of word equations
- WORD EQUATIONS WITH ONE UNKNOWN
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
- Efficient solving of the word equations in one variable
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: One-Variable Word Equations and Three-Variable Constant-Free Word Equations
