Towards parametrizing word equations

DOI10.1051/ita:2001123zbMath1112.68434OpenAlexW2132687296MaRDI QIDQ4331050

Habib Abdulrab, Pavel Goralčík, Gennady S. Makanin

Publication date: 14 May 2002

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

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

zbMATH Keywords

parametrizationfree monoiduniversal family

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Regular Patterns in Second-Order Unification ⋮ On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups

Cites Work

• Equations in free semigroups
• Minimal and complete word unification
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards parametrizing word equations