BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-71-190
       ENTRY:: November 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: An n log n algorithm for minimizing states in a finite
               automaton
        TYPE:: Technical Report
      AUTHOR:: Hopcroft, John E.
        DATE:: January 1971
       PAGES:: 16
    ABSTRACT:: An algorithm is given for minimizing the number of states in
               a finite automaton or for determining if two finite automata
               are equivalent. The asymptotic running time of the algorithm
               is bounded by k n log n where k is some constant and n is the
               number of states. The constant k depends linearly on the size
               of the input alphabet.
       NOTES:: [Adminitrivia V1/Prg/19951101]
         END:: STAN//CS-TR-71-190