CS 475
Fall 2025 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 | |
|---|---|---|---|---|---|---|---|---|
|
35895
|
Lecture-Discussion
Online
|
CG
CG
|
11:00AM
-12:15PM
ARRANGED
|
M
n.a.
|
106B1 Engineering Hall
n.a.
|
Viswanathan, M
Viswanathan, M
|
|
|
|
35887
|
Lecture-Discussion
Online
|
CU
CU
|
11:00AM
-12:15PM
ARRANGED
|
M
n.a.
|
106B1 Engineering Hall
n.a.
|
Viswanathan, M
Viswanathan, M
|
|
|
|
80999
|
Online
|
DS3
|
ARRANGED
|
n.a.
|
n.a.
|
Viswanathan, M
|
|
|
|
41803
|
Online
|
DS4
|
ARRANGED
|
n.a.
|
n.a.
|
Viswanathan, M
|
|
|
|
79870
|
Lecture-Discussion
Online
|
MC3
MC3
|
2:00PM
-3:15PM
ARRANGED
|
F
n.a.
|
Location Pending
n.a.
|
Viswanathan, M
Viswanathan, M
|
|
|
|
79871
|
Lecture-Discussion
Online
|
MC4
MC4
|
2:00PM
-3:15PM
ARRANGED
|
F
n.a.
|
Location Pending
n.a.
|
Viswanathan, M
Viswanathan, M
|
|