| Details: |
Regular and context-free languages, and other formal languages, push down and finite-state automata, and other finite machines. Turning machine compu?tability, halting problems. May not be taken for credit by students who have received credit for CS 521. |