Mar 28, 2024  
2013-2014 Undergraduate Catalog 
    
2013-2014 Undergraduate Catalog [ARCHIVED CATALOG]

Add to Portfolio (opens a new window)

CSE 343 - 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. Offered winter.
Prerequisite(s): CSE 361 and major standing in CS.



Add to Portfolio (opens a new window)