University of Calgary
Courses Descriptions
Submitted by admin on Wed, 06/29/2011 - 13:41.
CPSC 313 - Introduction to Computability
An introduction to abstract models of sequential computation, including finite automata, regular expressions, context-free grammars, and Turing machines. Formal languages, including regular, context-free, and recursive languages, methods for classifying languages according to these types, and relationships among these classes.
|
Current Sessions
Previous Sessions
|
Tech News