A Parallel Algorithm for Minimization of Finite Automata

In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5 using data parallel and message passing models. We show that its time complexity on a p processor EREW PRAM (p n) for inputs of size n is O(nlog2 n p + logn logp) uniformly on almost all instances. The work done by our algorithm is thus within a factor of O(logn) of the best known sequential algorithm. The space used by our algorithm is linear in the input size. The actual resource requirements of our implementations are consistent with these estimates. Although parallel algorithms have been proposed for this problem in the past, they are not practical. We discuss the implementation details and the experimental results.

• Type: Conference
• Year: 1996
• Where: IPPS
• Authors: Bala Ravikumar, X. Xiong
• Keywords: Deterministic Finite State, Distributed And Parallel Computing, IPPS 1996, Parallel Algorithms, Processor Erew Pram