Homework Solutions.
Announcements
The Final is Tues, Dec. 18, 12:00-2:30, PH403. Here is a list of topics to be covered.
Covers context-free languages up to but not including the Parikh Theorem. As usual, open book and notes.
A revised construction for complementing a DPDA.
Here is some mail discussion and examples of what is required.
In problem (2), assume L is an infinite regular language. The results do not hold for finite languages.
The assumption that the alphabet contains at least two symbols is required for question 1(d); you do not need it for question 2. In fact, I don't care much about empty or single-letter alphabets, so henceforth you may assume any alphabet has at least two symbols unless you are explicitly told otherwise.
3 Sept: Homework 0
10 Sept: Homework 1
17 Sept: Homework 2
26 Sept: Homework 3
10 Oct: Homework 4
17 Oct: Homework 5
24 Oct: Homework 6
14 Nov: Homework 7
28 Nov: Homework 8
Homework Solutions