ABSTRACT
This chapter describes the formal constructions for deterministic finite-state automata (DFA) union and DFA intersection. It discusses the algorithm for DFA isomorphism showing that two DFAs are isomorphic if and only if they are language equivalent and have the same number of states. The chapter explains DFA minimization and Myhill-Nerode theorem. It demonstrates that DeMorgan’s law indeed works for DFA, and can be checked through isomorphism because minimal DFA for a given regular language are isomorphic.
