One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
From MaRDI portal
Publication:2817399
DOI10.1007/978-3-662-53132-7_27zbMath1436.68284OpenAlexW2490379986MaRDI QIDQ2817399
Publication date: 30 August 2016
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53132-7_27
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.
- 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
- Unnamed Item
This page was built for publication: One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations