|
Finite Automata and Regular Languages
|
|
Assignment #1
|
Design and Verification of Finite Automata
|
Due January 28
|
|
Quiz #1
|
Finite Automata and Regular Expressions:
Including material discussed in lectures on
or before Wednesday, February 2 and in
Tutorial Exercises
4,
5,
and 6
|
February 10
|
|
Quiz #2
|
Proofs that Languages are Not Regular: Including
material discussed in lectures on or before
Friday, February 11 and in
Tutorial Exercise 7.
|
February 17
|
|
Context-Free Grammars and Languages
|
|
Assignment #2
|
Design and Verification of Context-Free Grammars.
Information about
the marking scheme used, and common errors
is now available.
|
Due March 4
|
|
Quiz #3
|
Advanced concepts for context-free grammars and languages:
Including material discussed in lectures on or before
Wednesday, March 16 and in Tutorial Exercises
10 and
11.
|
March 24
|
|
Turing Machines and Decidability
|
|
Quiz #4
|
Interpretation and Design of Turing machines:
Including material discussed in lectures on or before
Wednesday, March 23 and in Tutorial Exercise
12.
|
March 31
|
|
Quiz #5
|
Turing Machine Variants and Simulations:
Including material discussed in lectures on or before
Friday, April 1 and in Tutorial Exercise
13.
|
April 7
|
|
Assignment #3
|
Reductions and Decidability
|
Due April 15
|
|
Term Tests
|
|
Midterm Test
|
Finite Automata and Regular Languages; Introduction to
Context-Free Grammars and Languages. Including material
discussed in lectures on or before Monday, March 7
and in tutorials on or before Wednesday, March 9.
|
March 10
|
|
Final Examination
|
True/False and Multiple Choice questions about all topics
discussed in the course. Open-ended questions on topics
discussed after the midterm test, notably including advanced
topics concerning context-free languages and grammars,
and Turing machines and decidability. An
examination review
is now available.
|
April 22 at 8 am
|
This page was most recently changed on Friday, April 15, 2005 by
Wayne Eberly.
|
