Parallel algorithms for finite automata problems

  • B. Ravikumar
Workshop on Randomized Parallel Computing Panos Pardalos, University of Florida, Gainesville Sanguthevar Rajasekaran, University of Florida, Gainesville
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1388)


Finite automata are among the most extensively studied and well understood models of computation. They have wide ranging applications — for example, in image compression, protocol validation, game theory and computational biology just to mention only some recent ones. Here we will attempt to present a comprehensive survey of parallel algorithms for many fundamental computational problems on finite automata. It is well known that fundamental analysis problems involving deterministic finite automata have polynomial time algorithms, but the problems become hard when the input automata are nondeterministic. A similar difference is observed for parallel algorithms: most problems involving DFA as input have NC algorithms, while such algorithms are unlikely with NFA as input.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • B. Ravikumar
    • 1
  1. 1.Department of Computer ScienceUniversity of Rhode IslandKingston

Personalised recommendations