CMPT440L - Formal Languages and Computability

3 Credit(s)

Liberal Arts
The study of formal languages, automata, and computability provides the theoretical foundation for the design, specification, and compilation of programming languages. The formal languages of the Chomsky Hierarchy, their grammars, and the associated abstract machines or automata will be studied. This leads naturally to consideration of the theory of computability.

Prerequisite(s): CMPT 422N