Parallel hashing and integer sorting
Journal of Algorithms
The parallel complexity of coarsest set partition problems
Information Processing Letters
An efficient parallel algorithm for the single function coarsest partition problem
Theoretical Computer Science
An O(n log n) implementation of the standard method for minimizing n-state finite automata
Information Processing Letters
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Parallel Algorithm for Minimization of Finite Automata
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Non-blocking parallel subset construction on shared-memory multicore architectures
AusPDC '13 Proceedings of the Eleventh Australasian Symposium on Parallel and Distributed Computing - Volume 140
Minimization of symbolic automata
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments
International Journal of Parallel Programming
| Hi-index | 0.00 |
In this paper, we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel algorithm for solving the problem on an arbitrary CRCW PRAM has been proposed. For n number of states and k number of inputs in 驴 of the DFA to be minimized, the algorithm runs in O(kn log n) time and uses O(n / log n) processors.