Data-parallel programming on MIMD computers
Data-parallel programming on MIMD computers
An introduction to parallel algorithms
An introduction to parallel algorithms
The parallel complexity of coarsest set partition problems
Information Processing Letters
An efficient parallel algorithm for the single function coarsest partition problem
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Efficient learning of typical finite automata from random walks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Parallel DFA Minimization Algorithm
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Better algorithms for analyzing and enacting declarative workflow languages using LTL
BPM'11 Proceedings of the 9th international conference on Business process management
| Hi-index | 0.00 |
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 \leq n) for inputs of size n is O(\frac{n\log ^2n}{p}+\log n\ \log p) uniformly on almost all instances. The work done by our algorithm is thus within a factor of O(\log n) 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.