|
May 09, 2025
|
|
|
|
CPSC 520 - Theory of Computation 3 Credit(s)
Prerequisites: CPSC 227 and knowledge of computer programming. Finite automata and Pushdown automata; Register machines; Recursive functions and sets; Languages, regular expressions; Context-free languages; Regular and context-free grammars; Pumping lemmas. Turing machines, Church-Turing thesis. Post-correspondence problem; Computability and complexity.
Add to Portfolio (opens a new window)
|
|