Jan 14, 2025  
2013-2015 Undergraduate Catalog 
    
  Publication Home
  Correspondence Directory
  Historical Sketch
  University Mission Statement
  Regional Accreditation
  Admission to the University
  Financial Information
  Policies and Regulations Governing Student Life
  Academic Policies
  Academic and Student Support Services
  General Education Curriculum Requirements
  Honors Program
  International Programs
  Writing in the Major Program (WIM)
  Pre-College/Bridge Programs
  Undergraduate Degrees and Requirements
  Schools / Colleges / Departments
  Undergraduate Programs
  Course Descriptions
  Academic Calendar
  Organization of the University
  Faculty
  Campus Map
  General Education Course Diagram
  General Education Course Diagram (PDF)
  GE Curriculum Advising Matrix
  GE Curriculum Advising Matrix Image
HELP
2013-2015 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.