Title of article
A new algorithm for the construction of minimal acyclic DFAs
Author/Authors
Bruce W. Watson، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2003
Pages
17
From page
81
To page
97
Abstract
We present a semi-incremental algorithm for constructing minimal acyclic deterministic finite automata. Such automata are useful for storing sets of words for spell-checking, among other applications. The algorithm is semi-incremental because it maintains the automaton in nearly minimal condition and requires a final minimization step after the last word has been added (during construction).
Keywords
Incremental algorithm , Recursive algorithm , Algorithmics , Minimal acyclic deterministic finite automata
Journal title
Science of Computer Programming
Serial Year
2003
Journal title
Science of Computer Programming
Record number
1079690
Link To Document