A parallel algorithm for the minimization of finite state automata

@inproceedings{Srikant1990APA,
  title={A parallel algorithm for the minimization of finite state automata},
  author={Y. N. Srikant},
  year={1990}
}
A parallel algorithm for the set partitioning problem which has applications in the minimization of finite state automata is presented. The algorithm runs on a CREW PRAM in O(log2 n)z time and requires 0(n) processors.