CSCI 331: Computational Models
Description:
Regular languages, finite automata, context-free languages
and grammars, push-down automata, Turing machines,
algorithms and the Church-Turing thesis, and deceivability
|
|
For course content please see website.
To check your grades please see D2L. |

