CSE103: 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.

5 Credits


Formerly CMPS 130

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.