CS 475
CS 475 - Formal Models of Computation
Fall 2025
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Formal Models of Computation | CS475 | CG | 35895 | PKG | 3 | 1100 - 1215 | M | 106B1 Engineering Hall | Mahesh Viswanathan |
| Formal Models of Computation | CS475 | CG | 35895 | PKG | 3 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | CS475 | CU | 35887 | PKG | 3 | 1100 - 1215 | M | 106B1 Engineering Hall | Mahesh Viswanathan |
| Formal Models of Computation | CS475 | CU | 35887 | PKG | 3 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | CS475 | DS3 | 80999 | ONL | 3 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | CS475 | DS4 | 41803 | ONL | 4 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | CS475 | DSU | 81125 | ONL | 3 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | CS475 | MC3 | 79870 | PKG | 3 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | CS475 | MC3 | 79870 | PKG | 3 | 1400 - 1515 | F | Mahesh Viswanathan | |
| Formal Models of Computation | CS475 | MC4 | 79871 | PKG | 4 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | CS475 | MC4 | 79871 | PKG | 4 | 1400 - 1515 | F | Mahesh Viswanathan | |
| Formal Models of Computation | MATH475 | CG | 35903 | PKG | 3 | - | Mahesh Viswanathan | ||
| Formal Models of Computation | MATH475 | CG | 35903 | PKG | 3 | 1100 - 1215 | M | 106B1 Engineering Hall | Mahesh Viswanathan |
| Formal Models of Computation | MATH475 | CU | 35897 | PKG | 3 | 1100 - 1215 | M | 106B1 Engineering Hall | Mahesh Viswanathan |
| Formal Models of Computation | MATH475 | CU | 35897 | PKG | 3 | - | Mahesh Viswanathan |
See full schedule from Course Explorer
Official Description
Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; linear-bounded automata and context-sensitive languages; computability and the halting problem; undecidable problems; recursive functions; Chomsky hierarchy; computational complexity. Course Information: Same as MATH 475. 3 undergraduate hours. 3 or 4 graduate hours. Prerequisite: CS 374 or ECE 374.