Loading...

Course Description

(Cross-listed as MATH 0170). Models of computation: Turing machines, pushdown automata, and finite automata. Grammars and formal languages, including context-free languages and regular sets. Important problems, including the halting problem and language equivalence theorems.  Prerequisites:COMP 15 and MATH/COMP 61  or graduate standing
Loading...

Thank you for your interest in this course.  Unfortunately, the course you have selected is currently not open for enrollment.  Please use the button below to be added to our mailing list and we will notify you when enrollment opens.  

Required fields are indicated by .