CSE 343 Theory of Computation
(4 credits)
Description:
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.
Prerequisites: CSE 361 and major standing in CS.