Finite automata that recognise regular languages: DFA vs NFA, the subset construction, regular expressions, and a worked NFA-to-DFA conversion.