Automata Theory    3 s.h

Catalog description

Abstract models of computers, and the languages they generate or recognize. Finite state automata and regular expressions; Context-free grammars and pushdown automata; Turing machines. Limits of each model, including decidability and undecidability of computing-related problems. Applications of these models to areas such as input validation, security, language design, and compilers. Prereq.: CSCI 3710 .