| |
Apr 05, 2025
|
|
|
|
|
Fall 2025 Undergraduate Catalog
|
CSE 350 - Theory of Computation: Honors
Introduces the abstract notions of machine computation for honors students. Includes finite automata, regular expressions, and formal languages, with emphasis on regular and context-free grammars. Explores what can and cannot be computed by considering various models of computation including Turing machines, recursive functions, and universal machines. Not for credit in addition to CSE 303 .
4 credits
Prerequisite(s): CSE 113 or CSE 150 or CSE 215 ; AMS 210 or MAT 211 ; Honors in Computer Science or the Honors College or the WISE Honors Program or University Scholars or the Simons STEM Scholars Program.
|
|