Minimisation of acyclic deterministic automata in linear time
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A Discipline of Programming
A Fast New Semi-incremental Algorithm for the Construction of Minimal Acyclic DFAs
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
| Hi-index | 0.00 |
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic finite automata (MADFAs). Such 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).