Systems of Word Equations and Polynomials: a New Approach

Aleksi Saarela
(Turku Centre for Computer Science TUCS and Department of Mathematics, University of Turku)

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of the equations. These methods give the first nontrivial upper bounds for the sizes of the systems.

In Petr Ambrož, Štěpán Holub and Zuzana Masáková: Proceedings 8th International Conference Words 2011 (WORDS 2011), Prague, Czech Republic, 12-16th September 2011, Electronic Proceedings in Theoretical Computer Science 63, pp. 215–225.
Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.27 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org