|
Dec 05, 2024
|
|
|
|
CSCE 422 - Theory of Computing Finite automata and regular expressions, context-free grammars and push-down automata, nondeterminism. Context-sensitive grammars and the Chomsky hierarchy of grammars. Turing machine and the halting problem. Undecidable problems. Church’s Conjecture and its implications. Prerequisites Prerequisites: MACT 200 and Senior standing. When Offered Offered in fall and spring. (3 cr.)
Check course scheduling information
Add to Portfolio (opens a new window)
|
|