CS 350 Automata/Formal Lang theory

Description	Finite-state automata and regular expressions, context-free grammars and pushdown automata, Turing machines, computability and decidability, and complexity classes.
Credit Hours	Non-credit
Type	Lecture
Prerequisites	Undergraduate level CS 250 Minimum Grade of C and Undergraduate level MA 125 Minimum Grade of C
Files	cs350syllmaster.pdf Master Syllabus

Semester	Section	Days	Time	URL
Spring 2012	2C	TR	11:00 am-12:15 pm	Class homepage
Fall 2011	2D	TR	12:30 pm-01:45 pm	Class homepage
Spring 2011	3A	MW	04:00 pm-05:15 pm	Class homepage
Fall 2010	2B	TR	09:30 am-10:45 am	Class homepage
Spring 2010	4B	TR	05:30 pm-06:45 pm	Class homepage
Fall 2009	2B	TR	09:30 am-10:45 am	Class homepage
Spring 2009	4N	TR	04:00 pm-05:15 pm	Class homepage
Fall 2008	2B	TR	09:30 am-10:45 am	Class homepage
Spring 2008	3B	MW	05:30 pm-06:45 pm	Class homepage
Fall 2007				Class homepage
Spring 2007				Class homepage
Fall 2006				Class homepage
Spring 2006				Class homepage
Fall 2005				Class homepage
Spring 2005				Class homepage