Logistics
Deterministic Finite Automata (DFAs) Examples
HW1 out
Reading: Sipser 1.1 or Linz 2.1.
HW1 solutions and more examples (from recitation 1)
Quiz1 on W 9/30. [grades distribution]
Formal Definitions of DFA
Complement Language
General Strategies for "number of a's divisible by N",
"binary/decimal numbers divisible by N"
and "does [not] contain/end_with PATTERN" problems.
**State merging and DFA-DFA equivalence.
**Extending transition function \delta^*.
Reading: Sipser 1.1, Linz 2.1, 2.4.
Inductive Proofs; Regular Language and Regular Operations (cross-product construction)
HW2 due on Thursday 5pm (on Canvas only).
HW2 solutions.
Quiz 2 on F 10/9. [grades distribution]
Reading: Sipser 1.2 or Linz 2.2.
NFA; epsilon-free NFA => DFA
Readings: Sipser 1.1, 1.2, Linz 2.2, 2.3.
Quiz 3 on F 10/16. [grades distribution]
epsilon-closure; NFA=>DFA
**DFA minization
Regular Exps
Readings: Sipser 1.2, Linz 2.3, 2.4
Quiz 4 on F 10/23. [grades distribution]
REs => NFA. NFA => REs.
pumping lemma.
Review problems for midterm (to be discussed in the extended recitation, 8-10pm on Thu)
HW5 due W 10/28 @ 5pm.
HW5 solutions
Extra office hour: 5-5:30pm (Liang).
Midterm on F 10/30 [grades distribution]
Take-home version due in class on Monday 11/2.
CFGs.
**Regular Grammars and Linear CFGs.
Chomsky Normal Form.
Sipser 2.1.
Ambiguity. Chomsky Normal Form.
Union, Intersection, Complement.
Infix vs. Postfix (SVO vs. SOV).
Extra Credit Problem: CKY Parsing
Bottom-Up Parsing; CKY algorithm.
Pushdown Automata (NFA with a stack)
Sipser 2.2, 2.3, 2.4.
Non-deterministic vs. deterministic PDA.
Pushdown Automata <=> CFGs.
Pumping Lemma for CFGs
Sipser 2.2, 2.3, 2.4.
Turing Machines as Acceptors
Turing Machines as Transducers/Computers
Recursive Enumerable and Recursive Languages
**Chomsky Hierarchy.
Sipser 3.1. Linz 9.
(optional) Quiz 8.