Lecture. Finite state concepts; sequential machines and state minimization; Chomsky grammar; algorithms on grammars; computability and Turing machines; non-computable functions. Prerequisite: CS 3100 and MATH 2300.
| Updated1 | Course Id | Units | Day | Time | Room | Location | Instructor | Additional Course Fees |
Availability2 |
|---|---|---|---|---|---|---|---|---|---|
| 3/26/2026 1:01 PM | CS 4410 002 | 3 |
MWF |
10:00A - 10:50A |
DBH 165 |
TURLOCK |
Martin, Melanie |
$0.00 | 4 |
Course Notes
Hybrid Online - Synchronous. In-person class meetings will be on campus at the room, day, and time listed. Online class meetings will be at the day and time listed.