CS150 HW5
       	              Set May 20, Tuesday
                      Due June 3, Tuesday, at 6pm
                      Total: 80 pts


Q1 [10 pts] Convert the grammar

            S -> AaAb
            A -> aS | bA | a

   to a PDA that accepts the same language by empty stack. Please
   represent the PDA as a transition diagram.


Q2 [10 pts] P. 252 (or P. 246 in 2nd ed)  Ex.6.3.4.
   Convert the PDA of Ex. 6.1.1 to ...

   Although the PDA of Ex. 6.1.1 is a final-state PDA, let's treat it as
   an empty-stack PDA for simplicity.

Q3 [20 pts] P. 277 (or P. 271 in 2nd ed)  Ex.7.1.3
   Repeat Ex. 7.1.2 for the following ...

   Please note that you need show the resulting CFG after each major step
   of the conversion procedure.

Q4 [20 pts] P. 286 (or P. 280 in 2nd ed)  Ex.7.2.1: b), c)

Q5 [20 pts] P. 297 (or P. 292 in 2nd ed)  Ex.7.3.2
   Consider the following two languages: ...

Q6 [Optional, 0 pts] P. 308 (or P. 303 in 2nd ed)  Ex.7.4.3: b), c)