To introduce the student of computer science to, and to provide some depth in theoretical models for computation. This course provides unified coverage of the hierarchies of formal languages and non-deterministic automata, emphasizing the correspondence between them. The theory of computability and decidability is introduced. Topics covered include: Role of formal languages and automata in the study of computability and complexity. Finite state automata and regular expressions. Pushdown automata and context-free grammars. Turing machines and computable functions.