1)Construct the grammar for the following PDA. M=({q0, q1},{0,1},{X,z0},d,q0,Z0,F) and where dis…

1)Construct the grammar for the following PDA.

M=({q0, q1},{0,1},{X,z0},d,q0,Z0,F) and where dis given by

d(q0,0,z0)={(q0,XZ0)}, d(q0,0,X)={(q0,XX)},d(q0,1,X)={(q1, e)}, d(q1,1,X)={(q1,

e)},d(q1, e,X)={(q1, e)}, d(q1, e, Z0 )={(q1, e)}. (12)

b) Prove that if L is N(M1) for some PDA M1 then L is L(M2 ) for some PDA M2.

2) Construct a PDA that recognizes the language

{aibjck| i,j,k>0 and i=j or i=k}.

b) Discuss about PDA acceptance

(1) From empty Stack to final state.

(2) From Final state to Empty Stack.

 

Looking for a Similar Assignment? Hire our Top Uk Tutors while you enjoy your free time! All papers are written from scratch and are 100% Original. Try us today! Active Discount Code FREE15