CSCE 428/828: Automata, Computation, and Formal Languages
Introduction to the classical theory of computer science. Finite state automata and regular languages, minimization of automata. Context free languages and pushdown automata, Turing machines and other models of computation, undecidable problems, introduction to computational complexity.
|Course Format:||Lecture 3|