Functions for the general solution of parametric word equations

DOI10.1007/3-540-63045-7_20MaRDI QIDQ4376059zbMATH OpenFDO

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

Publication date 9 August 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63045-7_20

zbMATH Keywords

free monoidsgeneral solutions of equationsparametric equationsparametric transformationsparametric words

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Functional equations and inequalities (39B99)

Review text

Let \(x_1,x_2,\dots,x_n,\dots\) be a countable alphabet of word variables and let \(\lambda_1,\lambda_2,\dots,\lambda_i,\dots\) be a countable alphabet of natural number variables. One defines inductively a parametric word. A parametric equation in a free monoid is given by an equality of parametric words. A parametric transformation is called a parametric solution of the equation if the result of the application of the transformation to the equation is the trivial equation. Here the authors give the general solution of the equation \(x_1x_2x_3x_4=x_3x_1^\lambda x_2x_5\) in a free monoid. For the entire collection see [Zbl 0865.00035].

Recommendations

• scientific article; zbMATH DE number 3881202
• scientific article; zbMATH DE number 3912921
• Generalizations of some functional equations
• scientific article; zbMATH DE number 989248
• scientific article; zbMATH DE number 825873
• scientific article; zbMATH DE number 6195600
• On the construction of functional equations with prescribed general solution
• scientific article; zbMATH DE number 3853654
• On existence of solutions of parametrized generalized equations
• scientific article; zbMATH DE number 3871832

Cited in

(10)

• Parametrisation of solutions of parametric equation in free monoid
• Pseudosymmetric equations in a free monoid.
• scientific article; zbMATH DE number 522840 (Why is no real title available?)
• Towards parametrizing word equations
• On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups
• Functions for parametrization of solutions of an equation in a free monoid
• Parametrizability by regular expressions for equations on words
• On general solution of word equations
• Parametrization of the solutions of the equation \(x_1x_2\cdots x_{n-1}x_n=x_nx_{n-1}\cdots x_2x_1\) in a free monoid.
• Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general

This page was built for publication: Functions for the general solution of parametric word equations

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