Week 1: Alphabets, strings and languages.
Weeks 2: State-transition diagrams
Weeks 3: Regular expressions vs. state diagrams
Weeks 3-4: Minimizing state transition diagrams; Nonregular languages
Weeks 4-5: Context-free languages
Weeks 6-7: Parsing
Weeks 7-8: Specifying algorithms
Weeks 8-9: Verifying algorithms
Weeks 9-10: Examples from Ch. 3
Weeks 10-11: Additional verification techniques
Weeks 11-12: Unimplementable specifications
Week 12: Review: loop invariants + other topics
Back to CISC223 home page.