2001•Unpublished venueRequires access
Finite Automata
Ding‐Zhu Du, Ker‐I Ko
Open publisher page 0 citations
Abstract
Chapter 2 studies deterministic and nondeterministic finite automata and their relation with regular languages. It includes the following topics: the construction of finite automata, combining simple automata into new automata, the equivalence of deterministic finite automata and nondeterministic finite automata and regular expressions, minimum finite automata, and the pumping lemma.