4. Show that the pda constructed in Example 7.6 accepts the strings aabb and aaabbbb, and that bo...
[20 points] As an example of a PDA look at the one below that accepts the following language (Z is the stack start symbol): {a”br | n >0} U{a}. a, 1; 11 b, 1; a, Z; 12 b, 1 ; 90 q1 q2 1,2; a, Z;À Z: 93 We want to show that the language L below is a CFL by designing the PDA P, defined as P= {{90, 91, 92}, {0, 1}, {x, Z},0,40, 2, {92}}, that accepts it:...