On the Complexity of Intersecting Finite State Automata

  • Authors:

  • George Karakostas;Anastasios Viglas;Richard J. Lipton

  • Affiliations:

  • -;-;-

  • Venue:
  • COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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.