Jan 13, 2025  
2012-2013 Graduate Catalog 
    
Catalog Navigation
  Catalog Home
  President’s Message
  Academic Calendar
  Administration
  Admission
  Catalog Bulletin
  FERPA Guidelines
  Financial Information
  General Policies
  Graduate Courses
  Graduate Education
  Graduate Programs, Certificates, Specializations, Emphases
  Research Resources
  Student Records
  University Overview
HELP
2012-2013 Graduate Catalog [ARCHIVED CATALOG]

COS 451 - Automata, Computability, and Languages

Fundamentals of formal languages and the mathematical theory of computation; finitestate automata, nondeterminism, regular expressions, and Kleene’s Theorem; context-free grammars, pushdown automata, the correspondence theorem and the pumping lemma; computability, Turning machines, and the halting problem.

Prerequisites & Notes
COS 250.

Credits: 3