Skip Navigation
Jack Baskin School of EngineeringUC Santa Cruz

CMPS 130


Various representations for regular languages, context-free grammars,
normal forms, parsing, pushdown automata, pumping lemmas, Turing
machines, the Church-Turing thesis. Prerequisite(s): course 101. D.
Bailey, M. Warmuth, R. Levinson

(sourced from /cse/classes/cmps130/description.txt)