|
Jan 15, 2025
|
|
|
|
CS 421 - Theory of ComputingUnits: 3 Regular and context-free languages, and other formal languages, push down and finite-state automata, and other finite machines. Turning machine computability, halting problems. May not be taken for credit by students who have received credit for CS 521.
Prerequisite(s): CS 351 .
Add to My Favorites (opens a new window)
|
|