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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.