Proceedings 15th Annual IEEE Conference on Computational Complexity (2000)
July 4, 2000 to July 7, 2000
George Karakostas , Princeton University
Anastasios Viglas , Princeton University
Richard J. Lipton , Princeton University and Telcordia Applied Research
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time s k where s is the size of the automata. In this work, we prove that the assumption that there exists a better algorithm solving the FSA intersection emptiness problem implies that non-deterministic time is in subexponential deterministic time and separates NL from P . Furthermore, under a (more general) non-uniform variant of the assumption mentioned above we can prove that NL =NP.
A. Viglas, R. J. Lipton and G. Karakostas, "On the Complexity of Intersecting Finite State Automata," Proceedings 15th Annual IEEE Conference on Computational Complexity(CCC), Florence, Italy, 2000, pp. 229.