(3 cr) Topics include regular grammars, finite automata, context-free grammars, pushdown automata, and Turing machines; introductory treatment of computable and non-computable functions; and halting problems. Prerequisites: CIS 331.
Add to Portfolio (opens a new window)
