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 |
|---|---|---|---|---|---|---|---|---|---|
| 10/25/2025 7:01 AM | CS 4410 001 | 3 |
TR TR |
9:30A - 10:45A 9:30A - 10:45A |
DBH 164 HYBRID 001 |
TURLOCK |
Liang, Xuejun |
$0.00 | 8 |
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. Students must be available at the class times listed in the Class Schedule, and must attend in person on days indicated as such by the instructor. Students do not have the option to choose in-person or virtual, nor opt for asynchronous participation.