Models of computers including finite automata and Turing machines. Basics of formal languages with applications to the syntax of programming languages. Alternate characterizations of language classes. Proving unrecognizability. Unsolvable problems and their relevance to the semantics of programming. [Note: Enrolment is restricted; see Note 1 above. Offered: F,W,S] Prereq: (CS 240 or SE 240), CS 241, (CS 245 or SE 112/212), MATH 239 or 249; Computer Science students only. Antireq: CS 365
