The Emptiness Problem for Intersections of Regular Languages

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.

[1]  H. B. HuntIII.  On the complexity of finite, pushdown, and stack automata , 1976 .

[2]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[3]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[4]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[5]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[6]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[7]  Jacobo Torán,et al.  Complexity Classes with Complete Problems Between P and NP-C , 1989, FCT.

[8]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[9]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[10]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[11]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[12]  Patrick C. Fischer,et al.  Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations , 1980, SIAM J. Comput..

[13]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[14]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[15]  Zvi Galil,et al.  Hierarchies of complete problems , 1976, Acta Informatica.

[16]  Jürgen Dassow,et al.  Computational Calculus and Hardest Languages of Automata with Abstract Storages , 1991, FCT.

[17]  Ronald V. Book.  What is Structural Complexity Theory , 1989 .