@techreport{TR-DCC-92-01,
  number = {DCC-92-01},
  author = {Lucchesi, Cláudio L. and Kowaltowski, Tomasz},
  title = {Applications of Finite Automata Representing Large Vocabularies},
  month = {January},
  year = {1992}, 
  institution = {Department of Computer Science, University of Campinas},
  note = {In English, 25 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      The construction of minimal acyclic deterministic partial finite
      automata to represent large natural language vocabularies is
      described.  Applications of such automata include: spelling
      checkers and advisers, multilanguage dictionaries, thesauri,
      minimal perfect hashing and text compression.
  }
}