CMPS 130
- Spring 2008
- Winter 2008
- Spring 2007
- Fall 2006
- Winter 2006
- Winter 2005
- Fall 2004
- Spring 2004
- Fall 2003
- Spring 2003
- Fall 2002
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)

