Theory of Computation (Fall 2013): Closure Properties of Regular Languages; DFA & NFA Implementation
Theory of Computation (Fall 2014): Closure Properties of Regular Languages; Programmatic Aspects of Implementing DFAs and NFAs
Theory of Computation (Fall 2014): Lecture 02: Deterministic Finite Automata; How DFAs Work; DFA Transition Functions; Formal Languages Accepted by DFAs; Sample DFA Problems; Sample
