An introduction to abstract models of sequential computation, including finite automata, regular expressions, context-free grammars, and Turing machines. Formal languages, including regular, context-free, and recursive languages, methods for classifying languages according to these types, and relationships among these classes.
This course may not be repeated for credit.
Prerequisite(s)
- Mathematics 271 or 273, one of Philosophy 279 or 377, and one of Computer Science 219, 233 or 235.
Sections
| LEC 1 | MWF 12:00 - 12:50
| | Philipp Woelfel | | |
| TUT 1 | M 14:00 - 14:50
| | | | |
| Notes: Thurs. 18:00 - Common tut. for all 313 sections to be held in ICT 121 |
| TUT 2 | W 14:00 - 14:50
| | | | |
| Notes: Thurs. 18:00 - Common tut. for all 313 sections - to be held in ICT 121 |
This course will be offered next in
Fall 2012.