CSCI-B 501 THEORY OF COMPUTING (3 CR.)
Deterministic and nondeterministic automata, regular expressions, pumping lemmas; context-free languages, parsing, pushdown automata, context-sensitive languages, LBA, LR(k) languages, closure and decidability of language classes. Turing machines, random access machines, grammars, general recursive functions, equivalence of computation models, universal machines, relative computing. Unsolvability, semi-recursive sets, Rice's Theorem. Space and time complexity. NP completeness.
2 classes found
Fall 2024
| Component | Credits | Class | Status | Time | Day | Facility | Instructor |
|---|---|---|---|---|---|---|---|
| LEC | 3 | **** | Open | 1:15 p.m.–2:30 p.m. | MW | IF 4012 | Leivant D |
Regular Academic Session / In Person
LEC: Total Seats: 15 / Available: 1 / Waitlisted: 0
Lecture (LEC)
- B 501 : CSCI-C 241 and C 343 recommended
| Component | Credits | Class | Status | Time | Day | Facility | Instructor |
|---|---|---|---|---|---|---|---|
| DIS | 3 | 5955 | Open | 1:15 p.m.–2:30 p.m. | F | IF 4012 | Leivant D |
Regular Academic Session / In Person
DIS 5955: Total Seats: 15 / Available: 1 / Waitlisted: 0
Discussion (DIS)