Data-Compression.org

data compression link collection

Efficient Creation of Finite State Automota

Published in Papers/Documentation, Esoterica/Miscellany

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.

http://www-zo.iinf.polsl.gliwice.pl/~sdeor/pub/cd00abs.htm

         

admin
Posted in October 30th, 2002

No User Commented In " Efficient Creation of Finite State Automota "

Subscribes to this post Comment RSS or TrackBack URL

Leave Your Reply Below

 Username

 Email Address

 Website

Sticky note: Please double check your comments before submit Please Note: The comment moderation maybe active so there is no need to resubmit your comment