Advertisement

Finding All Solutions of Equations in Free Groups and Monoids with Involution

  • Volker Diekert
  • Artur Jeż
  • Wojciech Plandowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8476)

Abstract

The aim of this paper is to present a PSPACE algorithm which yields a finite graph of exponential size and which describes the set of all solutions of equations in free groups and monoids with involution in the presence of rational constraints. This became possible due to the recently invented recompression technique of the second author.

He successfully applied the recompression technique for pure word equations without involution or rational constraints. In particular, his method could not be used as a black box for free groups (even without rational constraints). Actually, the presence of an involution (inverse elements) and rational constraints complicates the situation and some additional analysis is necessary. Still, the recompression technique is powerful enough to simplify proofs for many existing results in the literature. In particular, it simplifies proofs that solving word equations is in PSPACE (Plandowski 1999) and the corresponding result for equations in free groups with rational constraints (Diekert, Hagenah and Gutiérrez 2001). As a byproduct we obtain a direct proof that it is decidable in PSPACE whether or not the solution set is finite.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benois, M.: Parties rationelles du groupe libre. C. R. Acad. Sci. Paris, Sér. A 269, 1188–1190 (1969)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Dahmani, F., Guirardel, V.: Foliations for solving equations in groups: free, virtually free and hyperbolic groups. J. of Topology 3, 343–404 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Diekert, V., Gutiérrez, C., Hagenah, C.: The existential theory of equations with rational constraints in free groups is PSPACE-complete. Inf. and Comput. 202, 105–140 (2005); Conference version in Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 170–182. Springer, Heidelberg (2001)Google Scholar
  4. 4.
    Diekert, V., Lohrey, M.: Word equations over graph products. IJAC 18(3), 493–533 (2008)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Diekert, V., Matiyasevich, Y., Muscholl, A.: Solving word equations modulo partial commutations. TCS 224, 215–235 (1999); Special issue of LFCS 1997Google Scholar
  6. 6.
    Diekert, V., Muscholl, A.: Solvability of equations in free partially commutative groups is decidable. International Journal of Algebra and Computation 16, 1047–1070 (2006); Journal version of Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 543–554. Springer, Heidelberg (2001)Google Scholar
  7. 7.
    Durnev, V.G.: Undecidability of the positive ∀ ∃ 3-theory of a free semi-group. Sibirsky Matematicheskie Jurnal 36(5), 1067–1080 (1995) (in Russian); English translation: Sib. Math. J. 36(5), 917–929 (1995)Google Scholar
  8. 8.
    Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, New York (1974)zbMATHGoogle Scholar
  9. 9.
    Gutiérrez, C.: Satisfiability of word equations with constants is in exponential space. In: Proc. 39th FOCS 1998, pp. 112–119. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
  10. 10.
    Gutiérrez, C.: Satisfiability of equations in free groups is in PSPACE. In: Proc. 32nd STOC 2000, pp. 21–27. ACM Press (2000)Google Scholar
  11. 11.
    Hopcroft, J.E., Ulman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)Google Scholar
  12. 12.
    Ilie, L., Plandowski, W.: Two-variable word equations. Theoretical Informatics and Applications 34, 467–501 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Jeż, A.: Recompression: a simple and powerful technique for word equations. In: Portier, N., Wilke, T. (eds.) STACS. LIPIcs, vol. 20, pp. 233–244. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2013)Google Scholar
  14. 14.
    Kharlampovich, O., Myasnikov, A.: Irreducible affine varieties over a free group. II: Systems in triangular quasi-quadratic form and description of residually free groups. J. of Algebra 200(2), 517–570 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Kharlampovich, O., Myasnikov, A.: Elementary theory of free non-abelian groups. J. of Algebra 302, 451–552 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Kościelski, A., Pacholski, L.: Complexity of Makanin’s algorithm. J. Association for Computing Machinery 43(4), 670–684 (1996)CrossRefzbMATHGoogle Scholar
  17. 17.
    Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. Sbornik 103, 147–236 (1977) English transl. in Math. USSR Sbornik 32 (1977)Google Scholar
  18. 18.
    Makanin, G.S.: Equations in a free group. Izv. Akad. Nauk SSR, Ser. Math. 46, 1199–1273 (1983) English transl. in Math. USSR Izv. 21 (1983)Google Scholar
  19. 19.
    Makanin, G.S.: Decidability of the universal and positive theories of a free group. Izv. Akad. Nauk SSSR, Ser. Mat. 48, 735–749 (1984) (in Russian); English translation in: Math. USSR Izvestija 25, 75–88 (1985)Google Scholar
  20. 20.
    Matiyasevich, Y.: Hilbert’s Tenth Problem. MIT Press, Cambridge (1993)Google Scholar
  21. 21.
    Matiyasevich, Y.: Some decision problems for traces. In: Adian, S., Nerode, A. (eds.) LFCS 1997. LNCS, vol. 1234, pp. 248–257. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  22. 22.
    Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. J. Association for Computing Machinery 51, 483–496 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  23. 23.
    Plandowski, W.: An efficient algorithm for solving word equations. In: Proc. 38th STOC 2006, pp. 467–476. ACM Press (2006)Google Scholar
  24. 24.
    Plandowski, W.: (unpublished, 2014)Google Scholar
  25. 25.
    Plandowski, W., Rytter, W.: Application of Lempel-Ziv encodings to the solution of word equations. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 731–742. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  26. 26.
    Razborov, A.A.: On Systems of Equations in Free Groups. PhD thesis, Steklov Institute of Mathematics (1987) (in Russian)Google Scholar
  27. 27.
    Razborov, A.A.: On systems of equations in free groups. In: Combinatorial and Geometric Group Theory, pp. 269–283. Cambridge University Press (1994)Google Scholar
  28. 28.
    Rips, E., Sela, Z.: Canonical representatives and equations in hyperbolic groups. Inventiones Mathematicae 120, 489–512 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  29. 29.
    Schulz, K.U.: Makanin’s algorithm for word equations — Two improvements and a generalization. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol. 572, pp. 85–150. Springer, Heidelberg (1992)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Volker Diekert
    • 1
  • Artur Jeż
    • 2
    • 4
  • Wojciech Plandowski
    • 3
  1. 1.Institut für Formale Methoden der InformatikUniversity of StuttgartGermany
  2. 2.Institute of Computer ScienceUniversity of WroclawPoland
  3. 3.Max Planck Institute für InformatikSaarbrückenGermany
  4. 4.Institute of InformaticsUniversity of WarsawPoland

Personalised recommendations