A parallel algorithm for the minimization of finite state automata

References

• Aho , A. V. , Hopcroft , J. E. and Ullman , J. D. 1974 . The Design and Analysis of Computer Algorithms , 157 – 162 . Addison-Wesley .
   Google Scholar
• Hopcroft , J. E. 1971 . “ An n log n algorithm for minimizing states in a finite automaton ” . In Theory of Machines and Computations , Edited by: Kohavi , Z. and Paz , A. 189 – 196 . Academic Press .
   Google Scholar
• Cole , R. 1987 . “ Parallel merge sort ” . In Ultracomputer Note 115 , New York University . Courant Institute of Mathematical Sciences
   Google Scholar
• Rytter W. A note on optimal parallel transformations of regular expressions to non-deterministic finite automata University of Warwick Oct 1986 Research Report No. 84
   Google Scholar
• Rytter , W. 1987 . Parallel time 0(log n) recognition of unambiguous context-free languages . Information and Computation , 73 ( 1 )
   Web of Science ®Google Scholar
• Miller , G. L. and Reif , J. 1985 . Proc. Int. Symp. Found. Comp. Sci. . Parallel tree contraction and its applications . 1985 .
   Google Scholar
• Gibbons A. Rytter W. An optimal parallel algorithm for dynamic expression evaluation and its applications University of Warwick April 1986 Research Report No. 77
   Google Scholar
• Hillis , W. D. and Steel , G. L. 1986 . Data parallel algorithms . CACM , Dec
   Google Scholar