Question: For consider the following nondeterministic PDA : In this machine, REJECT occurs when a string crashes. Notice here that the STACK alphabet is =
For consider the following nondeterministic PDA :

In this machine, REJECT occurs when a string crashes. Notice here that the STACK alphabet is Γ = {x) .
(i) Show that the string ab can be accepted by this machine by taking the branch from READ1 to POP1 , at the correct time.
(ii) Show that the string bbba can also be accepted by giving the trace that shows when to take the branch.
START READ PUSH x a, h a. h READ POP POP ACCEPT
Step by Step Solution
3.40 Rating (166 Votes )
There are 3 Steps involved in it
i For the string ab to be accepted the following trace can be followed The initial state is READ0 wi... View full answer
Get step-by-step solutions from verified subject matter experts
