An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
From MaRDI portal
Publication:5026390
DOI10.1137/20M1310448zbMath1492.68115arXiv1805.09535OpenAlexW4226092457MaRDI QIDQ5026390
Publication date: 8 February 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.09535
Related Items (2)
Word equations in the context of string solving ⋮ On the Solution Sets of Entire Systems of Word Equations
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
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
- Algebraic properties of word equations
- Word equations with \(k\)th powers of variables
- On maximal chains of systems of word equations
- WORD EQUATIONS WITH ONE UNKNOWN
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
- Word Equations Where a Power Equals a Product of Powers
- One-Variable Word Equations and Three-Variable Constant-Free Word Equations
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
- Efficient solving of the word equations in one variable
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
