@inbook{Lange1992,
    Abstract = {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.},
    Address = {Berlin, Heidelberg},
    Author = {Lange, Klaus-J{\"o}rn and Rossmanith, Peter},
    BookTitle = {Mathematical Foundations of Computer Science 1992: 17th International Symposium Prague, Czechoslovakia, August 24--28, 1992 Proceedings},
    Editor = {Havel, Ivan M. and Koubek, V{\'a}clav},
    File = {3-540-55808-X\_33 (0) - a - a - e.pdf},
    ISBN = {978-3-540-47291-9},
    Pages = {346--354},
    Publisher = {Springer Berlin Heidelberg},
    Title = {The emptiness problem for intersections of regular languages},
    URL = {https://doi.org/10.1007/3-540-55808-X\_33},
    Year = {1992},
    bdsk-url-1 = {https://doi.org/10.1007/3-540-55808-X\_33},
    date-added = {2017-12-19 16:58:07 +0000},
    date-modified = {2017-12-19 16:58:07 +0000},
    doi = {10.1007/3-540-55808-X_33}
}

@inbook{Lange1992, Abstract = {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.}, Address = {Berlin, Heidelberg}, Author = {Lange, Klaus-J{\"o}rn and Rossmanith, Peter}, BookTitle = {Mathematical Foundations of Computer Science 1992: 17th International Symposium Prague, Czechoslovakia, August 24--28, 1992 Proceedings}, Editor = {Havel, Ivan M. and Koubek, V{\'a}clav}, File = {3-540-55808-X_33 (0) - a - a - e.pdf}, ISBN = {978-3-540-47291-9}, Pages = {346--354}, Publisher = {Springer Berlin Heidelberg}, Title = {The emptiness problem for intersections of regular languages}, URL = {https://doi.org/10.1007/3-540-55808-X_33}, Year = {1992}, bdsk-url-1 = {https://doi.org/10.1007/3-540-55808-X_33}, date-added = {2017-12-19 16:58:07 +0000}, date-modified = {2017-12-19 16:58:07 +0000}, doi = {10.1007/3-540-55808-X_33} }