May 14, 2024  
2011-2012 Undergraduate Catalog 
    
Catalog Navigation
  Catalog Home
  President’s Message
  Abbreviations
  Academic Calendars
  Academic Policies
  Admission
  Auxiliary Services
  Colleges and Programs
  Course Descriptions
  Disclaimers
  Expenses and Fees
  Facilities and Centers
  Financial Aid
  Graduate Catalog
  General Education Requirements
  Honors College
  Majors and Minors
  Officers and Faculty
  Student Services and Facilities
  University Overview
HELP
2011-2012 Undergraduate 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
COS 250.

Credits: 3