Complexity Analysis: Transformation Monoids of Finite Automata
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.
KeywordsGreen’s relations Finite monoids Regular languages Communication complexity PSPACE-completeness
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)Google Scholar
- 4.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)Google Scholar
- 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
- 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