Nov 23, 2024  
2012-2013 Undergraduate Catalog 
    
2012-2013 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

APM 381 - Theory of Computation

(4)
Formal models of computation, including finite state automata, pushdown automata and Turing machines. Regular and context-free languages. The computational models are used to discuss computability issues. Identical with CSE 343. Offered winter.
Prerequisite(s): APM 367 with a grade of 2.0 or higher.



Add to Portfolio (opens a new window)