Incremental construction of minimal deterministic finite cover automata

We present a fast incremental algorithm for constructing minimal DFCA for a given language. Since it was shown that the minimal DFCA for a language L has less states than the minimal DFA for the same language L, this technique seems 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.