CS 361 INTRODUCTION TO THE THEORY OF COMPUTATION (3-0-3)(F,S) Regular languages, finite automata, context-free languages, pushdown automata, Turing machines, decidability, introduction to reducibility and computational complexity. PREREQ: CS 321.