CS 475

CS 475 - Formal Models of Computation

Fall 2023

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Formal Models of ComputationCS475C335887LCD31530 - 1645 T R  1214 Siebel Center for Comp Sci Mahesh Viswanathan
Formal Models of ComputationCS475C435895LCD31530 - 1645 T R  1214 Siebel Center for Comp Sci Mahesh Viswanathan
Formal Models of ComputationMATH475C335897LCD31530 - 1645 T R  1214 Siebel Center for Comp Sci Mahesh Viswanathan
Formal Models of ComputationMATH475C435903LCD31530 - 1645 T R  1214 Siebel Center for Comp Sci Mahesh Viswanathan

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.