A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic finite automata (MADFAs).Suc h automata represent finite languages and are therefore useful in applications such as storing words for spell-checking, computer and biological virus searching, text indexing and XML tag lookup.In such applications, the automata can grow extremely large (with more than 106 states) and are difficult to store without compression or minimization.
The taxonomization method arrives at all of the known algorithms, and some which are likely new ones (though proper attribution is not attempted, since the algorithms are usually of commercial value and some secrecy frequently surrounds the identities of the original authors).
KeywordsRegular Expression Minimization Algorithm Trade Secret Incremental Algorithm Text Indexing
Unable to display preview. Download preview PDF.
- 1.Daciuk, J.D., Watson, B.W. and R.E. Watson. An Incremental Algorithm for Constructing Acyclic Deterministic Transducers. (Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, Ankara, Turkey, 30 June-1 July 1998).Google Scholar
- 3.Mihov, S.Direct Building of Minimal Automaton for Given List. (Av ailable from firstname.lastname@example.org).Google Scholar
- 6.Watson, B.W. A Fast New Semi-Incremental Algorithm for the Construction of Minimal Acyclic DFAs. (Proceedings of the Third Workshop on Implementing Automata, Rouen, France, September 1998).Google Scholar