A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Given m nite 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 aredoi:10.1007/3-540-55808-x_33 fatcat:z4zqgw3ckbewbkbichpwyqu3re