One-variable word equations and three-variable constant-free word equations
From MaRDI portal
Publication:4683239
DOI10.1142/S0129054118420121zbMATH Open1473.68131WikidataQ129400473 ScholiaQ129400473MaRDI QIDQ4683239FDOQ4683239
Authors: Dirk Nowotka, Aleksi Saarela 
Publication date: 20 September 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
- 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
- Word equations with one unknown
- Independent systems of word equations: from Ehrenfeucht to eighteen
Cites Work
- One-variable word equations in linear time
- Word equations with one unknown
- Efficient solving of the word equations in one variable
- On word equations in one variable
- Title not available (Why is that?)
- A proof of Ehrenfeucht's conjecture
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- On F-semigroups with three generators
- On the independence of equations in three variables.
- Title not available (Why is that?)
- Systems of word equations, polynomials and linear algebra: a new approach
- On maximal chains of systems of word equations
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
- Algebraic properties of word equations
- Title not available (Why is that?)
Cited In (11)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
- Standard words and solutions of the word equation \(X_1^2\cdots X_n^2=(X_1\cdots X_n)^2\)
- Independent systems of word equations: from Ehrenfeucht to eighteen
- An optimal bound on the solution sets of one-variable word equations and its consequences
- Equations over the \(k\)-binomial monoids
- A compactness property of the \(k\)-abelian monoids
- Word equations in the context of string solving
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
- On the Solution Sets of Entire Systems of Word Equations
- An Analysis and a Reproof of Hmelevskii’s Theorem
- On the solution sets of three-variable word equations
This page was built for publication: One-variable word equations and three-variable constant-free word equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4683239)
