website
0.3
Efficient Creation of Finite State Automota
http://www-zo.iinf.polsl.gliwice.pl/~sdeor/pub/cd00abs.htm
rating:
not rated
This paper describes a method which creates minimal acyclic deterministic FSAs. These can be used to create an efficient representation of a dictionary of words by merging identical subtrees.
Created: 30 Oct 2002 00:00
by
Mark Nelson
Published: 30 Oct 2002 00:00
Last Updated: 30 Oct 2002 00:00 by
Mark Nelson
Other links to site gliwice.pl:
3 links to this site were found