Advertisement

Complexity Analysis: Transformation Monoids of Finite Automata

  • Christian BrandlEmail author
  • Hans Ulrich Simon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9168)

Abstract

We examine the computational complexity of some problems from algebraic automata theory and from the field of communication complexity: testing Green’s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations, these problems are closely linked with each other. We show that all of them are PSPACE-complete.

Keywords

Green’s relations Finite monoids Regular languages Communication complexity PSPACE-completeness 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)Google Scholar
  2. 2.
    Cho, S., Huynh, D.T.: Finite-Automaton Aperiodicity is PSPACE-Complete. Theor. Comput. Sci. 88(1), 99–116 (1991)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Colcombet, T.: Green’s relations and their use in automata theory. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 1–21. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  4. 4.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)Google Scholar
  5. 5.
    Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, pp. 254–266. IEEE Computer Society, Washington (1977)Google Scholar
  6. 6.
    Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)CrossRefGoogle Scholar
  7. 7.
    Pin, J.E.: Varieties of Formal Languages. Plenum Publishing, New York (1986)CrossRefGoogle Scholar
  8. 8.
    Schützenberger, M.P.: On Finite Monoids Having Only Trivial Subgroups. Information and Control 8(2), 190–194 (1965)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Stern, J.: Complexity of Some Problems from the Theory of Automata. Information and Control 66(3), 163–176 (1985)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Tesson, P., Thérien, D.: Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38(2), 135–159 (2005)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Yao, A.C.: Some complexity questions related to distributive computing. In: 11th Annual Symposium on Theory of Computing, pp. 209–213. ACM, New York (1979)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Theoretical Computer Science, Faculty of MathematicsRuhr-University BochumBochumGermany

Personalised recommendations