CMPS130: Computational Models

*****COURSES ARE SUBJECT TO CHANGE*****

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. Prerequisite(s): course 101.

5 Credits

YearFallWinterSpringSummer
2017-18
2016-17
2015-16
2014-15
2013-14
2012-13
2011-12
2010-11
2009-10
2008-09
2007-08
2006-07
2005-06
2004-05
2003-04
2002-03
2001-02
2000-01
1999-00

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.