Advertisement

Universality of Regular Realizability Problems

  • Mikhail N. Vyalyi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7913)

Abstract

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.

Keywords

Complexity Class Regular Language Binary Word Polynomial Hierarchy Mathematical System Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allender, E., Ogihara, M.: Relationships among PL, #L, and the determinant. Informatique Théorique et Applications 30, 1–21 (1996)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Àlvarez, C., Balcázar, J.L., Jenner, B.: Adaptive logspace reducibility and parallel time. Mathematical Systems Theory 28(2), 117–140 (1995)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Anderson, T., Loftus, J., Rampersad, N., Santean, N., Shallit, J.: Detecting palindromes, patterns and borders in regular languages. Information and Computation 207, 1096–1118 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Arora, S., Barak, B.: Computational complexity: a modern approach. Cambridge Univ. Press, Cambridge (2009)CrossRefGoogle Scholar
  5. 5.
    Immerman, N.: Nondeterministic space is closed under complement. SIAM Journal on Computing 17(5), 935–938 (1988)MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Kozen, D.: Automata and Computability. Springer, New York (1997)zbMATHCrossRefGoogle Scholar
  7. 7.
    Ladner, R.E., Lynch, N.A.: Relativization of questions about log space computability. Mathematical Systems Theory 10(1), 19–32 (1976)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Parikh, R.J.: On context-free languages. Journal of the ACM 13(4), 570–581 (1966)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Reinhardt, K., Allender, E.: Making nondeterminism unambiguous. SIAM Journal on Computing 29(4), 1118–1131 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Sipser, M.: Introduction to the theory of computation, 3rd edn. Cengage Learning, Boston (2012)Google Scholar
  11. 11.
    Vyalyi, M.N.: On models of a nondeterministic computation. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 334–345. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  12. 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
  13. 13.
    Vyalyi, M.N.: On regular realizability problems. Problems of Information Transmission 47(4), 342–352 (2011)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Vyalyi, M.N.: On complexity of regular realizability problems. arXiv:1211.0606v2Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mikhail N. Vyalyi
    • 1
  1. 1.Dorodnitsyn Computing CenterRussian Academy of ScienceRussia

Personalised recommendations