A parallel algorithm for the minimization of finite state automata
Y. N. Srikant · International Journal of Computer Mathematics · 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.