The emptiness problem for intersections of regular languages

  • Klaus-Jörn Lange
  • Peter Rossmanith
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)


Given m finite automata, the emptiness of intersection problem is to determine whether there exists a string which is accepted by all m automata. In the following we consider the case, when m is bounded by a function in the input length, i.e., in the size and number of the automata. In this way we get complete problems for nondeterministic space-bounded and timespace-bounded complexity classes. Further on, we get close relations to nondeterministic sublinear time classes and to classes which are defined by bounding the number of nondeterministic steps.


Turing Machine Regular Language Finite Automaton Intersection Problem Complete Problem 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C. Álvarez, J. Diaz, and J. Torán. Complexity classes with complete problems between P and NP-C. In Proc. of FCT, number 380 in LNCS, pages 13–25. Springer, 1989.Google Scholar
  2. [2]
    J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity Theory I. Springer, 1988.Google Scholar
  3. [3]
    J. F. Buss and J. Goldsmith. Nondeterminism within P. In Proc. of 8th STACS, number 480 in LNCS, pages 348–359. Springer, 1991.Google Scholar
  4. [4]
    S. R. Buss. The boolean formula value problem is in ALOGTIME. In Proc. 19th Ann. ACM Symp. on Theory of Computing, pages 123–131, 1987.Google Scholar
  5. [5]
    S. A. Cook. A taxonomy of problems with fast parallel algorithms. Inform. and Control, 64:2–22, 1985.zbMATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    J. Dassow and K.-J. Lange. Computational complexity and hardest languages of automata with abstract storages. In Proc. of 8th FCT, number 529 in LNCS, pages 200–209. Springer, 1991.Google Scholar
  7. [7]
    P. C. Fischer and C. M. R. Kintala. Real-time computations with restricted non-determinism. Math. Systems Theory, 12:219–231, 1979.zbMATHMathSciNetCrossRefGoogle Scholar
  8. [8]
    Z. Galil. Hierarchies of complete problems. Acta Inf., 6:77–88, 1976.zbMATHMathSciNetGoogle Scholar
  9. [9]
    J. Hopcroft and J. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading Mass., 1979.Google Scholar
  10. [10]
    H. Hunt. On the complexity of finite, pushdown, and stack automata. Math. Systems Theory, 10:33–52, 1976.zbMATHMathSciNetCrossRefGoogle Scholar
  11. [11]
    N. Jones. Space-bounded reducibility among combinatorial problems. J. Comp. System Sci., 11:68–85, 1975.zbMATHCrossRefGoogle Scholar
  12. [12]
    C. M. R. Kintala and P. C. Fischer. Refining nondeterminism in relativezed polynomial-time bounded computations. SIAM J. Comput., 9(1):46–53, 1980.zbMATHMathSciNetCrossRefGoogle Scholar
  13. [13]
    D. Kozen. Lower bounds for natural proof systems. In Proc. of 18th FOCS, pages 254–266, 1977.Google Scholar
  14. [14]
    R. Ladner and N. Lynch. Relativization of questions about log space computability. Math. Systems Theory, 10:19–32, 1976.zbMATHMathSciNetCrossRefGoogle Scholar
  15. [15]
    I. Niepel. Logarithmisch platzbeschränkte Komplexitätsklassen—Charakterisierung und offene Fragen. Diplomarbeit, University Hamburg, Mar. 1987. (in German).Google Scholar
  16. [16]
    W. Ruzzo. On uniform circuit complexity. J. Comp. System Sci., 22:365–338, 1981.zbMATHMathSciNetCrossRefGoogle Scholar
  17. [17]
    L. Stockmeyer and A. Meyer. Word problems requiring exponential time: preliminary report. In Proc. of the 5th Annual ACM Symposium on Theory of Computing, pages 1–9, 1973.Google Scholar
  18. [18]
    K. Wagner and G. Wechsung. Computational complexity. VEB Deutscher Verlag der Wissenschaften, Berlin, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Klaus-Jörn Lange
    • 1
  • Peter Rossmanith
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2

Personalised recommendations