Left Accent
UAB CIS Header

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
Master Syllabus

SemesterSectionDaysTimeURL
Spring 20122CTR11:00 am-12:15 pmClass homepage
Fall 20112DTR12:30 pm-01:45 pmClass homepage
Spring 20113AMW04:00 pm-05:15 pmClass homepage
Fall 20102BTR09:30 am-10:45 amClass homepage
Spring 20104BTR05:30 pm-06:45 pmClass homepage
Fall 20092BTR09:30 am-10:45 amClass homepage
Spring 20094NTR04:00 pm-05:15 pmClass homepage
Fall 20082BTR09:30 am-10:45 amClass homepage
Spring 20083BMW05:30 pm-06:45 pmClass homepage
Fall 2007Class homepage
Spring 2007Class homepage
Fall 2006Class homepage
Spring 2006Class homepage
Fall 2005Class homepage
Spring 2005Class homepage

Accent Right