@techreport{TR-DCC-93-22,
  number = {DCC-93-22},
  author = {Kowaltowski, Tomasz and Lucchesi, Cláudio L. and Stolfi, Jorge},
  title = {Minimization of Binary Automata},
  month = {September},
  year = {1993}, 
  institution = {Department of Computer Science, University of Campinas},
  note = {In English, 20 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      Finite automata used to represent large vocabularies of natural
      languages are quite sparse in the following sense: for the vast
      majority of states, almost all transitions lead to the rejecting
      state. This suggests a representation of the automaton in which
      each state is a small list of transitions entering non rejecting
      states. It is then possible to factor parts of those lists,
      thereby saving further space. Depending on the order in which the
      transitions appear on the lists, the degree of saving varies. This
      leads to the problem of minimizing such representations. This
      problem is interesting from a theoretical point of view and quite
      useful from a practical point of view, as the experimental results
      presented herein indicate.
  }
}