Two-variable word equations

DOI10.1051/ita:2000126zbMath0977.68070OpenAlexW2030247517MaRDI QIDQ2729626

Wojciech Plandowski, Lucian Ilie

Publication date: 23 July 2001

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2000__34_6_467_0/

zbMATH Keywords

Sturmian wordsword equations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

Farey codes and languages ⋮ Finding all solutions of equations in free groups and monoids with involution ⋮ Word equations in the context of string solving ⋮ Codes of central Sturmian words ⋮ On word equations in one variable ⋮ A logic for document spanners ⋮ On PSPACE generation of a solution set of a word equation and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
• Finding patterns common to a set of strings
• Equations in free semigroups
• Some combinatorial properties of Sturmian words
• Decision problems for patterns
• ON SYSTEMS OF EQUATIONS IN A FREE GROUP
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Complexity of Makanin's algorithm
• On the expressibility of languages by word equations with a bounded number of variables

This page was built for publication: Two-variable word equations