A note on mc-DFA and its minimization

In order to process multi-substring matching concurrently, we propose the multiclassified- final-state deterministic finite automata (shortly, mc-DFA) matching model which improves traditional deterministic finite automata (shortly, DFA) matching models. We also provide an mc-DFA minimization algorithm which can minimize the number of states in mc-DFA without the side effect of mismerging distinct substrings recognized.