This course introduces students to scanning and parsing and the theory of computation that supports these activities. Topics include: regular expressions and languages, finite state automata, scanning, context-free languages, pushdown automata, parsing, Turing machines, computability, and NP-completeness. Lect: 3 hrs./Lab: 1 hr. Prerequisites: MTH 210 and CPS 305 Course Weight: 1.00 Billing Units: 1
