0 votes 0 votes Show that the pda constructed in Example 7.6 accepts the string $aaabbbb$ that is in the language generated by the given grammar. Example 7.6: Construct a pda that accepts the language generated by a grammar with productions $S\rightarrow aSbb|a.$ Theory of Computation theory-of-computation peter-linz peter-linz-edition4 pushdown-automata + – Naveen Kumar 3 asked Jun 22, 2019 Naveen Kumar 3 194 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.