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)
- One of 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
| | Peter Hoyer | | |
| TUT 1 | R 18:00 - 18:50 M 14:00 - 14:50
| | | | |
| Notes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held in ICT 122 |
| TUT 2 | R 18:00 - 18:50 W 14:00 - 14:50
| | | | |
| Notes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held in ICT 122 |
| TUT 3 | R 18:00 - 18:50 M 17:00 - 17:50
| | | | |
| Notes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held in ICT 122 |
| TUT 4 | R 18:00 - 18:50 W 17:00 - 17:50
| | | | |
| Notes: Thurs. 18:00 - Common tutorial time for all 313 tutorials to be held in ICT 122 |
This course will be offered next in
Fall 2014.