On the Complexity of Intersecting Finite State Automata

@article{Karakostas2000OnTC,
  title={On the Complexity of Intersecting Finite State Automata},
  author={George Karakostas and Richard J. Lipton and Anastasios Viglas},
  journal={Theor. Comput. Sci.},
  year={2000},
  volume={302},
  pages={257-274}
}
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 σ where σ 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 also separates NL from P . Furthermore, under a (more general) non-uniform variant of… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS