Towards parametrizing word equations

DOI10.1051/ITA:2001123zbMATH Open1112.68434OpenAlexW2132687296MaRDI QIDQ4331050FDOQ4331050

Authors: 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

Recommendations

• Formal parametric equations
• Finite parametrization of solutions of equations in a free monoid. I
• Parametrisation of solutions of parametric equation in free monoid
• scientific article; zbMATH DE number 1114342
• Parametric equations in free groups

zbMATH Keywords

parametrizationfree monoiduniversal family

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Minimal and complete word unification
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equations in free semigroups
• Title not available (Why is that?)

Cited In (10)

• On general solution of word equations
• Title not available (Why is that?)
• Equations in words: An algorithmic contribution
• Regular patterns in second-order unification
• Title not available (Why is that?)
• On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
• The non-parametrizability of the word equation \(xyz=zvx\): a short proof
• Mathematical Foundations of Computer Science 2004
• Makanin's algorithm for word equations-two improvements and a generalization
• Parametrizability by regular expressions for equations on words

This page was built for publication: Towards parametrizing word equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331050)