Theory of Computation

Finite automata: DFA vs NFA, with the exam angle

Finite automata explained: the DFA and NFA 5-tuple, DFA vs NFA, a worked subset construction converting an NFA to a DFA, equivalence, and the exam angle.