This course includes: the study of regular languages, grammars and expressions, finite-state automata and their relationship to regular languages, context-free languages and grammars, and language recognition with stack machines and parsers. Additionally, the course also introduces properties of formal languages, computability, undecidability and computational complexity.


Prerequisites: CSC 3290