Abstract
We define in this article an approach to tackle the problem of the computation of the general solution of word equations. Parametric transformation, Nielsen's transformation and Rouen's transformation allowing to collect in one transformation some unbounded sequences of elementary transformations are given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Parametric Word Equations, G.S. Makanin, and H. Abdulrab, Rapport LITP 93.43, July 93.
Transformations of Word Equations with Three Variables: Rouen's Function, G.S. Makanin, and H. Abdulrab, Rapport LITP 93.44, July 93.
Transformations Algorithm of Word Equations with Four Variables, G.S. Makanin, and H. Abdulrab, Rapport LITP 93.49, September 93.
Bunches of Formal Parametric Equations, G.S. Makanin, H. Abdulrab and M.N. Maksimenko, Rapport LITP 93.62, December 93.
Bunches of Formal Parametric Equations with Three Variables. G.S. Makanin, H. Abdulrab and M.N. Maksimenko, LIR, Research rapport, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Makanin, G.S., Abdulrab, H. (1994). On general solution of word equations. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_51
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive