CSC 335 Finite Automata Chapter 2 Note

Subscribe to read and download this work.

Finite Automaton (FA)

Deterministic Finite Automata

Language of an NFA

Advantages & Caveats for NFA

Technologies for NFAs

Differences: DFA vs. NFA

Equivalence of DFA & NFA

NFA to DFA by subset construction

Correctness of subset construction

A few subtle properties of DFAs and NFAs