1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
2. C. Alvarez et al. “Parallel complexity in the design and analysis of concurrent systems”, in PARLE 91, Lecture Notes in Computer Science 505, Springer-Verlag, Berlin (1991).
3. N. Blum, “An O(n log n) implementation of the standard method for minimizing n-state finite automata”, Information Processing Letters 57, pp. 65–69, (1996).
4. S. Cho and D.T.Huynh, “The Parallel Complexity of Coarsest Set Partition Problems”, Information Processing Letters 42 pp. 89–94, 1992.
5. S. Cho and D.T. Huynh, “Parallel Algorithms for Finite Automata Problems”, Information and Computation, Vol 97, pp. 1–22, 1992.