On word equations in one variable
From MaRDI portal
Publication:547296
DOI10.1007/S00453-009-9375-3zbMATH Open1216.68125OpenAlexW2041189577MaRDI QIDQ547296FDOQ547296
Authors: Robert Dąbrowski, Wojciech Plandowski 
Publication date: 1 July 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9375-3
Recommendations
Cites Work
- Satisfiability of word equations with constants is in NEXPTIME
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-variable word equations
- Complexity of Makanin's algorithm
- Title not available (Why is that?)
- Equations in words: An algorithmic contribution
Cited In (14)
- One-variable word equations in linear time
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
- Mathematical Foundations of Computer Science 2003
- Two-variable word equations
- What Is Essential Unification?
- One-variable word equations and three-variable constant-free word equations
- Word equations with one unknown
- On the complexity of solving restricted word equations
- Title not available (Why is that?)
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
- One-variable word equations in linear time
- Word Equations with One Unknown
- Unification modulo lists with reverse relation with certain word equations
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
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)
