CSCI 5030G - Automata and Applications

This course studies the theories of various types of automata and their applications. Regular automata, Büchi automata, pushdown automata and finally tree automata are covered. Students discuss the respective formal languages and the fundamental theorems such as closure theorems and different versions of Nerode equivalences. The second part of the course discusses the applications of automata in selected areas of compilers, natural language processing, information retrieval, type checking of programs, composition of services and temporal logic reasoning.
Credit hours: 3
Prerequisite(s): Undergraduate courses in Discrete Mathematics, Algebra and Computational Complexity.