Abstract
We analyze Hmelevskii’s theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formulas of word and numerical parameters. We prove that the size of the finite representation is bounded by an exponential function on the size of the equation. We also prove that the shortest nontrivial solution of the equation, if it exists, is exponential, and that its existence can be solved in nondeterministic polynomial time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Albert, M.H., Lawrence, J.: A proof of Ehrenfeucht’s conjecture. Theoret. Comput. Sci. 41, 121–123 (1985)
Choffrut, C., Karhumäki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Springer, Heidelberg (1997)
Czeizler, E., Karhumäki, J.: On non-periodic solutions of independent systems of word equations over three unknowns. Internat. J. Found. Comput. Sci. 18, 873–897 (2007)
Eilenberg, S., Schützenberger, M.P.: Rational sets in commutative monoids. J. Algebra 13, 173–191 (1969)
von zur Gathen, J., Sieveking, M.: A bound on solutions of linear integer equalities and inequalities. Proc. Amer. Math. Soc. 72, 155–158 (1978)
Guba, V.S.: Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems. Mat. Zametki 40, 321–324 (1986)
Harju, T., Karhumäki, J., Plandowski, W.: Independent systems of equations. In: Lothaire, M. (ed.) Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)
Hmelevskii, Y.I.: Equations in free semigroups. Proc. Steklov Inst. of Math. 107 (1971); Amer. Math. Soc. Translations (1976)
Karhumäki, J., Saarela, A.: An analysis and a reproof of Hmelevskii’s theorem. In: Proc. of 12th International Conference on Developments in Language Theory, pp. 467–478 (2008)
Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)
Makanin, G.S.: The problem of solvability of equations in a free semigroup. Mat. Sb. 103, 147–236; English transl. in Math. USSR Sb. 32, 129–198 (1977)
Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. J. ACM 51, 483–496 (2004)
Plandowski, W., Rytter, W.: Application of Lempel-Ziv encodings to the solution of word equations. In: Proc. of 25th International Colloquium on Automata, Languages, and Programming, pp. 731–742 (1998)
Saarela, A.: A new proof of Hmelevskii’s theorem. Licentiate thesis, Univ. Turku (2009), http://users.utu.fi/amsaar/en/licthesis.pdf
Spehner, J.-C.: Quelques problemes d’extension, de conjugaison et de presentation des sous-monoides d’un monoide libre. Ph.D. Thesis, Univ. Paris (1976)
Spehner, J.-C.: Les presentations des sous-monoides de rang 3 d’un monoide libre. Semigroups. In: Proc. Conf. Math. Res. Inst., pp. 116–155 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saarela, A. (2009). On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)