University of Calgary

CPSC 313 - Introduction to Computability - Fall 2015

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.
This course may not be repeated for credit.


  • H(3-2T)


  • One of Computer Science 319 or 331 is strongly recommended as preparation for this course.


  • One of Mathematics 271 or 273, one of Philosophy 279 or 377, and one of Computer Science 219, 233 or 235.


This course will be offered next in Winter 2016.
Powered by UNITIS. More features.