Schedule

Readings:

• Class Notes 1
• Book: Chapter 0.2 - “Strings and Languages”, Chapter 1.3 - “Formal Definition of Regular Expressions”, Chapter 1.1. - “Formal Definition of a Finite Automaton”, Chapter 1.2 up to “Closure under Regular Operations”
• Lecture Notes 1, Sections 1-2.6

Readings:

• Class Notes 2
• Book: Chapter 1.3 - “Equivalence with Finite Automata”, Chapter 1.4, Chapter 2.2. - “Pushdown Automata” up to “Equivalence with Context-Free Languages”
• Lecture Notes 1, Sections 2.6-3.2

Readings:

• Class Notes 3
• Book: Chapter 3.1, Chapter 3.3, Chapter 4.1, Chapter 4.2.
• Lecture Notes 2, Sections 1-2.1

Readings:

• Class Notes 4
• Book: Chapter 5.1 up to “Reductions via Computation Histories”, Chapter 5.3.
• Lecture Notes 2, Sections 2.2-3.1

Readings:

• Class Notes 5
• Lecture Notes 3

Readings:

• Class Notes 6

Readings:

• Class Notes 7

Readings:

Readings:

Readings:

Readings:

Readings:

Readings: