Skip to main content

(CS 320) Introduction to Computational Theory

Finite state automata and regular expressions, context-free grammars and pushdown automata, turing machines, computability, and undecidability.

Credit Hours 3.0 Lecture
Prerequisites CS 203 and CIS 206
Offered Winter
Programs -

Course Outcomes

  1. Understand the limitations of Computer Algorithms.
  2. Understand grammars (languages) and their importance in Computer Science.
  3. Understand Church’s Thesis, the Halting Problem, and other key theories in Computer Science.
  4. Increase their problem solving skills by developing algorithms using Finite Automata, Grammars, and Turing Machines.