CST 5307 - Introduction to Automata, Formal Languages and Computability

Credits: 3 hrs

This course studies computer science theory and the mathematical foundations of digital computers. Its topic includes the family of computing machines (finite-state, push-down, and Turing), the Chomsky hierarchy of languages, decidability, unsolvable problems, and applications of automata to areas of syntactic analysis, modeling, and artificial intelligence.
Prerequisite(s): Admission to the MCST graduate program and advisor approval