CSCI 341 – Fall ’24
Catalog Description Finite automata, regular sets, pushdown automata, context-free grammars. Turing machines, recursive functions and undecidability. Prerequisite: MATH 241 or MATH 280. Schedule Section Time Location Lecture MWF 2-2:50PM Dana 227 Recitation Th 3-3:50PM Dana 303 Syllabus Syllabus PDF Lecture Notes These notes closely follow Michael Sipser’s Introduction to the Theory of Computation. I was also influenced by my notes from taking Prasad Jayanti’s course at Dartmouth College and notes from Zack Scherr at Bucknell University. If you want to use these notes for your own course, please just let me know! I’m also happy to share LaTeX source if […]