HuskyScheduler
Open the scheduler
CSE 5503: Theory of Computation
Formal models of computation, such as finite state automata, pushdown automata, and Turing machines, and their corresponding elements in formal languages (regular, context-free,recursively enumerable). The complexity hierarchy. Church's thesis and undecidability. NP completeness. Theoretical basis of design and compiler construction.
- Credits
- 3
- Offered
- Spring 2027
- Campuses
- Storrs
- Requirements
- Department consent required; open to graduate students in the Computer Science and Engineering program, others with permission. Not open for credit to students who have passed CSE 3502. Recommended preparation: CSE 2050 and 2500.
Spring 2027 sections
Taught by Alexander Russell.
| Section | Type | Meets | Instructor | Campus | Room | Seats |
|---|---|---|---|---|---|---|
| 001 | LEC | 11:00AM - 12:15PM / TuTh | Alexander Russell | Storrs | ITE 336 | 10 of 10 open |
Seats as of Nov 12, 2026. HuskyScheduler shows live seats when you search.
More courses
All CSE courses (Computer Science and Engineering) ยท All UConn subjects