Universality of Regular Realizability Problems
A regular realizability (RR) problem is to test nonemptiness of the intersection of some fixed language (filter) with a given regular language. We show that RR problems are universal in the following sense. For any language L there exists an RR problem equivalent to L under disjunctive reductions on nondeterministic log space.
We deduce from this result the existence of RR problems complete under polynomial reductions for many complexity classes including all classes of the polynomial hierarchy.
KeywordsComplexity Class Regular Language Binary Word Polynomial Hierarchy Mathematical System Theory
Unable to display preview. Download preview PDF.
- 10.Sipser, M.: Introduction to the theory of computation, 3rd edn. Cengage Learning, Boston (2012)Google Scholar
- 12.Vyalyi, M.N.: On nondeterminism models for two-way automata. In: Proc. VIII Int. Conf. on Discrete Models in Control System Theory, pp. 54–60. MAKS Press, Moscow (2009) (in Russian)Google Scholar
- 14.Vyalyi, M.N.: On complexity of regular realizability problems. arXiv:1211.0606v2Google Scholar