Theory of Computation (CS3102), Lecture 06, Professor Gabriel Robins, Spring 2018 (Panopto)

Specific topics covered in this lecture: review of finite automata, non-determinism, powerset construction, "Next" movie, benefits of non-determinism, regular expressions, type errors, converting regular expressions into finite automata, automta minimization, converting finite automata into regular expressions, generalized finita automata, characterization equivalence between finite automata and regular expressions