EECS 510
Elect Engr & Computer Science - Introdn to Theory of Computing
University of Kansas · Fall 2026
1 section1 open now
Catalog description
Finite state automata and regular expressions. Context-free grammars and pushdown automata. Turing machines. Models of computable functions and undecidable problems. The course emphasis is on the theory of computability, especially on showing limits of computation. (Same as MATH 510.) Prerequisite: C- or higher in EECS 210 and upper-level EECS eligibility.
Sections
Current meeting, instructor, credit, and enrollment details
1000
38 openSeats: 79/117 seats Last recorded: Jul 30, 2026, 1:16 AMClass #12692Fall 20263 credits
38 available79 enrolled117 capacity
- Days & times
- Mo We Fr · 11:00 – 11:50 AM
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Section notes
Source career: UGDL
Details checked 15 hours agoSeats checked 15 hours ago
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?