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 001 | 3 |
MWF MWF |
2:00P - 2:50P 2:00P - 2:50P |
DBH 102 HYBRID 001 |
TURLOCK |
Liang, Xuejun |
$0.00 | 12 |
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.