Remarks on multiple entry deterministic finite automata
| Authors | |
|---|---|
| Year of publication | 2007 |
| Type | Article in Periodical |
| Magazine / Source | Journal of Automata, Languages and Combinatorics |
| MU Faculty or unit | |
| Citation | |
| Field | Information theory |
| Keywords | multiple entry DFA; minimalization; conversion; decomposition |
| Description | We investigate several aspects of the multiple entry DFA's. We consider their DFA conversion. Further, we show that they appear as minimal NFA's for certain classes of languages. Finally, we deal with their decompositions into disjoint unions of automata with less number of states. |
| Related projects: |