The Community for Technology Leaders
Proceedings 15th Annual IEEE Conference on Computational Complexity (2000)
Florence, Italy
July 4, 2000 to July 7, 2000
ISSN: 1093-0159
ISBN: 0-7695-0674-7
pp: 229
George Karakostas , Princeton University
Anastasios Viglas , Princeton University
Richard J. Lipton , Princeton University and Telcordia Applied Research
ABSTRACT
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.
INDEX TERMS
CITATION

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.
doi:10.1109/CCC.2000.856753
83 ms
(Ver 3.3 (11022016))