Advertisement

Theory of Computing Systems

, Volume 61, Issue 2, pp 494–520 | Cite as

Equations Over Free Inverse Monoids with Idempotent Variables

  • Volker Diekert
  • Florent Martin
  • Géraud Sénizergues
  • Pedro V. Silva
Article
  • 86 Downloads

Abstract

We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse monoid has a solution. Moreover the problem becomes hard for DEXPTIME, as soon as the quotient group of the free inverse monoid has rank at least two. The upper bound is proved by a direct reduction to solve language equations with one-sided concatenation and a known complexity result by Baader and Narendran (J. Symb. Comput. 31, 277–305 2001). For the lower bound we show hardness for a restricted class of language equations. Decidability for systems of typed equations over a free inverse monoid with one irreducible variable and at least one unbalanced equation is proved with the same complexity upper-bound. Our results improve known complexity bounds by Deis et al. (IJAC 17, 761–795 2007). Our results also apply to larger families of equations where no decidability has been previously known. The lower bound confirms a conjecture made in the conference version of this paper.

Keywords

Free inverse monoid Equation Language equation Idempotent variable One-variable equation 

Notes

Acknowledgments

We would like to thank the referees for numerous comments which improved greatly the quality of the text. Florent Martin acknowledges support from Labex CEMPI (ANR-11-LABX-0007-01) and SFB 1085 Higher invariants. Pedro Silva acknowledges support from: CNPq (Brazil) through a BJT-A grant (process 313768/2013-7); and the European Regional Development Fund through the programme COMPETE and the Portuguese Government through FCT (Fundaç ão para a Ciência e a Tecnologia) under the project PEst-C/MAT/UI0144/2013. Volker Diekert thanks the hospitality of Universidade Federal da Bahia, Salvador Brazil, where part of this work started in Spring 2014. The authors are thankful to the program committee of CSR 2015 for awarding our paper with the Yandex-best-paper award; and one of the authors is even more thankful for the memorable event of Computer Science in Russia 2015 which was held at the shores of a truly magnificent Lake Baikal.

References

  1. 1.
    Appel, K.I.: One-variable equations in free groups. Proc. Amer. Math. Soc. 19, 912–918 (1968)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Baader, F., Narendran, P.: Unification of concept terms in description logics. J. Symb. Comput. 31, 277–305 (2001)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bormotov, D., Gilman, R., Myasnikov, A.: Solving one-variable equations in free groups. J. Group Theory 12, 317–330 (2009)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Ciobanu, L., Diekert, V., Elder, M.: Solution sets for equations over free groups are EDT0L languages. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) Proc. 42nd International Colloquium Automata, Languages and Programming (ICALP 2015), Part II, Kyoto, Japan, July 6-10, 2015, volume 9135 of Lecture Notes in Computer Science, pages 134–145. Springer, p 2015Google Scholar
  5. 5.
    Deis, T., Meakin, J.C., Sénizergues, G.: Equations in free inverse monoids. IJAC 17, 761–795 (2007)MathSciNetMATHGoogle Scholar
  6. 6.
    Diekert, V., Jeż, A., Plandowski, W.: Finding all solutions of equations in free groups and monoids with involution. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J., Vereshchagin, N.K. (eds.) Computer Science Symposium in Russia 2014, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings, volume 8476 of Lecture Notes in Computer Science, pages 1–15. Springer, p. 2014Google Scholar
  7. 7.
    Diekert, V., Martin, F., Sėnizergues, G., Silva, P. V.: Equations over free inverse monoids with idempotent variables. In: Beklemishev, L. D., Musatov, D. V. (eds.) Proc. 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, volume 9139 of Lecture Notes in Computer Science, pages 173–188. Springer, p 2015Google Scholar
  8. 8.
    Gutiérrez, C.: Satisfiability of equations in free groups is in PSPACE. In: Proceedings 32nd Annual ACM Symposium on Theory of Computing, STOC’2000, pages 21–27. ACM Press (2000)Google Scholar
  9. 9.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)Google Scholar
  10. 10.
    Jeż, A.: Recompression: a simple and powerful technique for word equations. J. ACM 63(1), 4:1–4:51 (2016). Conference version in STACS 2013MathSciNetGoogle Scholar
  11. 11.
    Lorents, A.A.: Representations of sets of solutions of systems of equations with one unknown in a free group. Dokl. A.ad. Nauk. 178, 290–292 (1968). in RussianMathSciNetMATHGoogle Scholar
  12. 12.
    Lothaire, M.: Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and Its Applications. Addison-Wesley, 1983. Reprinted by Cambridge University Press (1997)Google Scholar
  13. 13.
    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
  14. 14.
    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
  15. 15.
    Munn, W.D.: Free inverse semigroups. Proc. London Math. Soc. 29, 385–404 (1974)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)Google Scholar
  17. 17.
    Paterson, A.L.T.: Groupoids, inverse semigroups, and their operator algebras. Progress in Mathematics, 170. Birkhäuser (1999)Google Scholar
  18. 18.
    Petrich, M.: Inverse semigroups. Wiley (1984)Google Scholar
  19. 19.
    Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: Proc. 40th Ann. Symp. on Foundations of Computer Science, FOCS’99, pages 495–500. IEEE Computer Society Press (1999)Google Scholar
  20. 20.
    Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. J. ACM 51, 483–496 (2004)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Rozenblat, B.V.: Diophantine theories of free inverse semigroups. Siberian Math. J., 26:860–865, 1985. Translation from Sibirskii Mat. Zhurnal, volume 26:101–107 (1985)Google Scholar
  22. 22.
    Scheiblich, H.E.: Free inverse semigroups. Proc. Amer. Math. Soc. 38, 1–7 (1973)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Silva, P.V.: Word equations and inverse monoid presentations. In: Kublanovsky, S., Mikhalev, A., Higgins, P., Ponizovskii, J. (eds.) Semigroups and Applications, Including Semigroup Rings. Severny Ochag, St. Petersburg (1999)Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Volker Diekert
    • 1
  • Florent Martin
    • 2
  • Géraud Sénizergues
    • 3
  • Pedro V. Silva
    • 4
  1. 1.FMIUniversität StuttgartStuttgartGermany
  2. 2.Fakultät für MathematikUniversität RegensburgRegensburgGermany
  3. 3.LaBRIUniversité BordeauxTalence CedexFrance
  4. 4.Faculdade de CiênciasUniversidade do PortoPortoPortugal

Personalised recommendations