Computer Science and EngineeringCSE 103 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. (Formerly CMPS 130.)

Requirements

Prerequisite(s): CSE 101.

Credits

5

Quarter offered

Fall, Winter, Spring

Instructor

Delbert Bailey, Patrick Tantalo, Manfred Warmuth, Allen Van Gelder, Phokion Kolaitis, David Helmbold, Seshadhri Comandur