Languages and their representations. Grammars –Chomsky hierarchy. Regular sets and sequential machines. Context-free grammars — normal forms, basic properties. Pushdown automata and transducers. Operations on languages. Undecidable problems in language theory. Applications to the design of programming languages and compiler construction. Prereq: CS 360 or 365; Computer Science students only
