¸£Àû±ÆÕ¾

Study of three classical formal models of computation--finite state machines, context-free grammars, and Turing machines--and the corresponding families of formal languages. Power and limitations of each model. Parsing. Non-determinism. The Halting Problem and undecidability. The classes P and NP, and NP-completeness.

Prerequisite: Grade of C or better in either ²Ñ´¡Ìý225 or °ä³§°äÌý226

Typically offered in Fall and Spring