|
Feb 17, 2025
|
|
|
|
COSC 380 - Theory of Computation3 Credit Hours Countability and diagonalization. Finite automata and regular sets. Push-down automata and context-free languages. Introduction to Turing machines and undecidability.
(RE) Prerequisite(s): 311.
Add to Portfolio (opens a new window)
|
|