Question: Question 2: Consider the CFG, G, defined as: S - AB (S being the start symbol) A aAa B --bBb a) Apply the push down

Question 2: Consider the CFG, G, defined as: S - AB (S being the start symbol) A aAa B --bBb a) Apply the push down automaton (PDA) algorithm to determine whether or not the well formed formula (wff): abb, is in the language (L) generated by G, L(G). . [10] b) Is Gregular? If it is, write down the corresponding regular grammar. If it is not, explain in details why it is not [10]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
