194 views
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.$

Please log in or register to answer this question.

Related questions