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; and Philosophy 279 or 377; and 3 units from Computer Science 219, 233 or 235.
Antirequisite(s)
- Credit for Computer Science 313 and Computer Science 351 will not be allowed.
Sections
| LEC 1 | MWF 12:00 - 12:50
| | Wayne Michael Eberly | | Outline |
| Notes:
|
| TUT 1 | M 14:00 - 14:50 R 18:00 - 18:50
| | | | |
| Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in ICT 102
|
| TUT 3 | M 17:00 - 17:50 R 18:00 - 18:50
| | | | |
| Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 1850 in ICT 102
|
| TUT 5 | W 15:00 - 15:50 R 18:00 - 18:50
| | | | |
| Notes: All tutorial sections will have a common quiz on Thursdays at 18:00 to 18:50 in ICT 102
|