CS 475
Spring 2023 All Classes
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 or ECE 374.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
51363
|
Lecture-Discussion
|
C3
|
2:00PM
-3:15PM
|
TR
|
1304 Siebel Center for Comp Sci
|
Cosman, B
|
|
|
|
51364
|
Lecture-Discussion
|
C4
|
2:00PM
-3:15PM
|
TR
|
1304 Siebel Center for Comp Sci
|
Cosman, B
|
|