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.
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
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
Cho, S., Huynh, D.T.: Finite-Automaton Aperiodicity is PSPACE-Complete. Theor. Comput. Sci. 88(1), 99–116 (1991)
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)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
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)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
Pin, J.E.: Varieties of Formal Languages. Plenum Publishing, New York (1986)
Schützenberger, M.P.: On Finite Monoids Having Only Trivial Subgroups. Information and Control 8(2), 190–194 (1965)
Stern, J.: Complexity of Some Problems from the Theory of Automata. Information and Control 66(3), 163–176 (1985)
Tesson, P., Thérien, D.: Complete Classifications for the Communication Complexity of Regular Languages. Theory Comput. Syst. 38(2), 135–159 (2005)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Brandl, C., Simon, H.U. (2015). Complexity Analysis: Transformation Monoids of Finite Automata. In: Potapov, I. (eds) Developments in Language Theory. DLT 2015. Lecture Notes in Computer Science(), vol 9168. Springer, Cham. https://doi.org/10.1007/978-3-319-21500-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-21500-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21499-3
Online ISBN: 978-3-319-21500-6
eBook Packages: Computer ScienceComputer Science (R0)