Legacy Course Catalog
ECE 664 - Formal Languages, Computability, And Complexity
| Effectivity: | 05/19/2003 - Fall 2007 *** @ Purdue West Lafayette Traditional |
|---|---|
| Credits: | 3 |
| Instructional Types: | Lec |
| Usually Offered: | fal |
| Short Title: | Frm Lng Compt & Complx |
| Description: | 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. |
| School: | School Of Electrical And Computer Engineering |
| Department: | Electrical & Computer Engineering |
| Credit By Exam: | NO |
| Repeatable Flag: | NO |
| Temporary Flag: | NO |
| Full Time Privilege Flag: | NO |
| Honors Flag: | NO |
| Variable Title Flag: | NO |
Fall 2007 *** indicates the course was still an active course and was transferred to the Banner Catalog effective Spring 2008. This course was not expired Fall 2007.
