Question: {91, 92, 93, 94, 95, 96, 973 E, E) 92. = {a,b} 8(92, a, a) = {93, E) r = {x, $} 8(93, a, a)
{91, 92, 93, 94, 95, 96, 973 E, E) 92. = {a,b} 8(92, a, a) = {93, E) r = {x, $} 8(93, a, a) = {92,x} F={97) 8(92, E, E) = {94, ) Initial state = 91 8(94, 6, ) = {95, E) 8(9s, b, c) = {96, E) 8(96, b, x) = {94, E) 8(94, E, $) = {97, } where transition function contents are represented as: 8(X,b,c) = {Y,d) - X: current state, b: input symbol, c: stack top symbol being popped Y: next state, d: symbol being pushed () Identify a string that is accepted by the PDA and provide corresponding sequence of transitions. (ii) Draw the state diagram of M. (iii) Describe the language accepted by M
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
