This topic contains 0 replies, has 0 voices, and was last updated by  EduGorilla 1 year, 11 months ago.

  • Author
    Posts
  • #1440982 Reply
     EduGorilla 
    Keymaster
    Select Question Language :


    Consider a PDA which has 4 states. We have 3 alphabets (a,b,c) in a string. On first state , there are 3 transitions possible. Transition 1 : if “a” comes and stack is empty , then push it and remain on same state. Transition 2 : if “a” comes and stack is not empty , top symbol is also “a” , then also push “a” and remain on same state. Transition 3 : if “c” comes and top of stack is “a” then skip “c” and move to second state. Now in second state , it has 2 transitions. Transition 1 : if “c” comes and top of stack is “a” then skip “c” and remain on same state. Transition 2 : If “b” comes and top of stack is “a” , pop it and move to third state. Third state has 3 transitions. Transition 1 : If “b” comes and top of stack is “a” , pop it and remain on same state. Transition 2 : If “$” comes and stack is empty then go to the final state 4.

    The above PDA is accepting which of the following language :

    Options :-

    Post your Training /Course Enquiry
    Are You looking institutes / coaching center for
    • IIT-JEE, NEET, CAT
    • Bank PO, SSC, Railways
    • Study Abroad
    Select your Training / Study category
Reply To: Consider a PDA which has 4 states. We have 3 alphabets (a,b,c) in a string. On first state , there a….
Your information:




Verify Yourself




Log in with your credentials

or    

Forgot your details?

Create Account