|Section title||An incremental algorithm for constructing minimal deterministic finite cover automata|
|Section author(s)||Cezar Campeanu, Andrei Paun, J. R. Smith|
|Book title||Implementation and application of automata|
|Abstract||We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the DFCA for a language L can have less states than the DFA for L, this technique seen-is to be the best choice for incrementally building the automaton for a large language, especially when the number of states in the DFCA is significantly less than the number of states in the corresponding minimal DFA. We have implemented the proposed algorithm and have tested it against the best known DFCA minimization technique.|
Using APA 6th Edition citation style.
Times viewed: 485