CS150 HW5
       	              Set May 23, Thursday  
                      Due June 7, Friday, at 5pm
                      Total: 100 pts


Q1 [10 pts] Convert the grammar

            S -> AaA | AbA
            A -> aS | bA | a

   to a PDA that accepts the same language by empty stack.

   Please show the PDA as a diagram instead of a set of transitions.

Q2 [20 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 ...

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 [10 pts] P. 308 (or P. 303 in 2nd ed)  Ex.7.4.3: b), c)