Question: Let M be the PDA defined by Q = q _ ( 0 ) , q _ ( 1 ) , q _ ( 2

Let M be the PDA defined by Q=q_(0),q_(1),q_(2)\Sigma =a,b \Gamma =A F=q_(1),q_(2)\delta (q_(0),a,\lambda )=[q_(0),A]\delta (q_(0),\lambda ,\lambda )=[q_(1),\lambda ]\delta (q_(0),b,A)=[q_(2),\lambda ]\delta (q_(1),\lambda ,A)=[q_(1),\lambda ]\delta (q_(2),b,A)=[q_(2),\lambda ]\delta (q_(2),\lambda ,A)=[q_(2),\lambda ]. a) Describe the language accepted by M . b) Give the state diagram of M . c) Trace all computations of the strings aab,abb,aba in M. d) Show that aabb,aaabinL(M).

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!