Course Description for Computability and Automata
Computability and Automata
Prerequisite: COT 3100 and COP 3503
Description: This course covers applications of automata and language theory to CIS. Topics include finite automata and regular expressions; formal languages and syntactic analysis; pushdown automata and Turing machines; and undecidability and computational complexity.