Shahab Harrafi

  • Citations Per Year
Learn More
Nondeterministic Finite-state Automata (NFA) are simple, yet powerful devices that model a plethora of computationally oriented phenomena. One of the advantages of NFA’s is that they are closed under several operations, such as concatenation, intersection, difference, and homomorphic images. This makes NFA’s ideally suited for a modular approach, for(More)
We describe Map-Reduce implementations of two of the most prominent DFA minimization methods, namely Moore's and Hopcroft's algorithms. Our analysis shows that the one based on Hopcroft's algorithm is more efficient, both in terms of running time and communication cost. This is validated by our extensive experiments on various types of DFA's, with up to(More)
  • 1