CS 475
Spring 2022 Part of Term 1
Jan 18-May 4
Credit: 3 OR 4 hours.
Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; linear-bounded automata and context-sensitive languages; computability and the halting problem; undecidable problems; recursive functions; Chomsky hierarchy; computational complexity.
Same as MATH 475. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 374.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
51363
|
Lecture-Discussion
|
C3
|
12:30PM
-1:45PM
|
TR
|
203 Transportation Building
|
Cosman, B
|
|
|
|
51364
|
Lecture-Discussion
|
C4
|
12:30PM
-1:45PM
|
TR
|
203 Transportation Building
|
Cosman, B
|
|