| Prerequisites: COT 3100 and COP 3503. Applications of automata and language theory to CIS. Finite automata and regular expressions. Formal languages and syntactic analysis. Pushdown automata and Turing machines. Undecidability and computational complexity. |
