Skip to main content

Solution Sets for Equations over Free Groups are EDT0L Languages

  • Conference paper
  • First Online:
Automata, Languages, and Programming (ICALP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9135))

Included in the following conference series:

Abstract

We show that, given a word equation over a finitely generated free group, the set of all solutions in reduced words forms an EDT0L language. In particular, it is an indexed language in the sense of Aho. The question of whether a description of solution sets in reduced words as an indexed language is possible has been open for some years [9, 10], apparently without much hope that a positive answer could hold. Nevertheless, our answer goes far beyond: they are EDT0L, which is a proper subclass of indexed languages. We can additionally handle the existential theory of equations with rational constraints in free products \(\star _{1 \le i \le s}F_i\), where each \(F_i\) is either a free or finite group, or a free monoid with involution. In all cases the result is the same: the set of all solutions in reduced words is EDT0L. This was known only for quadratic word equations by [8], which is a very restricted case. Our general result became possible due to the recent recompression technique of Jeż. In this paper we use a new method to integrate solutions of linear Diophantine equations into the process and obtain more general results than in the related paper [5]. For example, we improve the complexity from quadratic nondeterministic space in [5] to quasi-linear nondeterministic space here. This implies an improved complexity for deciding the existential theory of non-abelian free groups: \(\mathsf {NSPACE}(n\log n\)). The conjectured complexity is \(\mathsf {NP}\), however, we believe that our results are optimal with respect to space complexity, independent of the conjectured \(\mathsf {NP}\).

Research supported by the Australian Research Council FT110100178 and the University of Newcastle G1301377. The first author was supported by a Swiss National Science Foundation Professorship FN PP00P2-144681/1. The first and third authors were supported by a University of Neuchâtel Overhead grant in 2013.

Manfred Kudlek has the distinction of being the only person to have attended all ICALP conferences during his lifetime. He worked on Lindenmayer systems, visited Kyoto several times, and taught the second author that bikes are the best means of transport inside Kyoto.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V.: Indexed grammars–an extension of context-free grammars. J. Assoc. Comput. Mach. 15, 647–671 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  2. Asveld, P.R.: Controlled iteration grammars and full hyper-AFL’s. Information and Control 34(3), 248–269 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  3. Benois, M.: Parties rationelles du groupe libre. C. R. Acad. Sci. Paris, Sér. A 269, 1188–1190 (1969)

    MATH  MathSciNet  Google Scholar 

  4. Diekert, V., Gutiérrez, C., Hagenah, Ch.: The existential theory of equations with rational constraints in free groups is \({\sf PSPACE}\)-complete. Information and Computation, 202, 105–140 (2005). Conference version in STACS 2001

    Google Scholar 

  5. 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.) CSR 2014. LNCS, vol. 8476, pp. 1–15. Springer, Heidelberg (2014)

    Google Scholar 

  6. Ehrenfeucht, A., Rozenberg, G.: On some context free languages that are not deterministic ET0L languages. RAIRO Theor. Inform. Appl. 11, 273–291 (1977)

    MATH  MathSciNet  Google Scholar 

  7. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Acad Press (1974)

    Google Scholar 

  8. Ferté, J., Marin, N., Sénizergues, G.: Word-mappings of level \(2\). Theory Comput. Syst. 54, 111–148 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gilman, R.H.: Personal communication (2012)

    Google Scholar 

  10. Jain, S., Miasnikov, A., Stephan, F.: The complexity of verbal languages over groups. In: Proc. LICS 2012, pp. 405–414. IEEE Computer Society (2012)

    Google Scholar 

  11. Jeż, A.: Recompression: a simple and powerful technique for word equations. In: Proc. STACS. LIPIcs, 20:233–244 (2013). Journal version to appear in JACM

    Google Scholar 

  12. Kharlampovich, O., Myasnikov, A.: Elementary theory of free non-abelian groups. J. of Algebra 302, 451–552 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)

    Google Scholar 

  14. Plandowski, W.: An efficient algorithm for solving word equations. Proc. STOC 2006, pp. 467–476. ACM Press (2006)

    Google Scholar 

  15. Plandowski, W.: Personal communication (2014)

    Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. Razborov, A.A.: On Systems of Equations in Free Groups. Ph.D thesis (1987)

    Google Scholar 

  18. 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 

  19. Rozenberg, G., Salomaa, A.: The Book of L. Springer (1986)

    Google Scholar 

  20. Rozenberg, G., et al. (Eds.): Handbook of Formal Languages, vol 1. Springer (1997)

    Google Scholar 

  21. Sela, Z.: Diophantine geometry over groups VIII: Stability. Annals of Math. 177, 787–868 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Volker Diekert .

Editor information

Editors and Affiliations

Additional information

Dedicated to Manfred Kudlek (1940–2012)

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciobanu, L., Diekert, V., Elder, M. (2015). Solution Sets for Equations over Free Groups are EDT0L Languages. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47666-6_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47665-9

  • Online ISBN: 978-3-662-47666-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics