CMPS 130: Computational Models
- Fall 2009
- Spring 2009
- Fall 2008
- Spring 2008
- Winter 2008
- Spring 2007
- Fall 2006
- Winter 2006
- Fall 2005
- Winter 2005
- Fall 2004
- Spring 2004
- Fall 2003
- Spring 2003
- Fall 2002
- Spring 2002
- Fall 2000
- Fall 1999
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. P. Kolaitis, R. Levinson, M. Warmuth
5 Credits
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.