Efficient solving of the word equations in one variable

DOI10.1007/3-540-58338-6_80zbMath1494.68098OpenAlexW2171035269MaRDI QIDQ5096891

No author found.

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_80

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

Related Items (5)

On the Complexity of Solving Restricted Word Equations ⋮ 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 ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences ⋮ One-variable word equations in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for computing the repetitions in a word
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Complexity of Makanin's algorithm
• Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable

This page was built for publication: Efficient solving of the word equations in one variable