Mar 28, 2024  
2017-2019 Undergraduate Catalog 
    
2017-2019 Undergraduate Catalog [ARCHIVED CATALOG]

MAT 4386 - Automata, Formal Languages and Computability

Credits: 3 hrs
This course studies computer science theory and the mathematical foundations of digital computers. Its topics include 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): CSC 4340 and MAT 2316, or consent of instructor. Cross-listed as CSC 4386.