CMPS130: Computational Models

Various representations for regular languages, context-free grammars, normal forms, simple parsing, pumping lemmas, Turing machines, the Church-Turing thesis, intractable problems, the P-NP question. Prerequisite(s): course 101.

5 credits

Year	Fall	Winter	Spring	Summer

While the information on this web site is usually the most up to date, in the event of a discrepancy please contact your adviser to confirm which information is correct.