COUNTING THE NUMBER OF MINIMAL DFCA OBTAINED BY MERGING STATES
Finite Deterministic Cover Automata (DFCA) can be obtained from Deterministic Finite Automata (DFA) using the similarity relation and a method of merging similar states. The DFCA minimization procedure can yield different results depending on the order of merging the similar states, because the minimal DFCA for a finite language is in general not unique. We count the number of minimal DFCA that can be obtained from a given minimal DFA with n states
Read more