May 21, 2024  
2014-2015 University Catalog 
    
Catalog Navigation
  Catalog Home
  General Information
  Academic Calendar
  Admissions
  Courses
  Disability Resources
  Undergraduate University Core
  University Regulations
  Undergraduate
  College of Agriculture
  College of Education
  College of Engineering
  College of Health and Human Sciences
  College of Liberal Arts
  School of Management
  College of Pharmacy
  College of Science
  College of Technology
  College of Veterinary Medicine
  Exploratory Studies
  Honors College
  Graduate
  Graduate Studies
  Combined Degree Programs
  Professional
  Doctor of Pharmacy
  Doctor of Veterinary Medicine
HELP
2014-2015 University Catalog [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

ECE 66400 - Formal Languages, Computability, And Complexity

Credit Hours: 3.00. Topics in computability theory and formal languages include recursive function theory, the equivalence of various generic programming languages for numeric calculations and string manipulations, regular languages and finite state automata, and context-free and context-sensitive languages. In complexity theory, emphasis is on the theory of NP-completeness, including proof methods, the distinctions between strong- and weak-sense NP-completeness, NP-hardness, and performance-guaranteed approximation algorithms. Offered in alternate years. Prerequisite: ECE 60800 . Typically offered Fall.


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)