2 votes 2 votes Theory of Computation theory-of-computation context-free-language + – Payal Rastogi asked Nov 2, 2015 • retagged Jul 4, 2017 by Arjun Payal Rastogi 3.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes I Felt the options are wrong here it is first accepting all a's irrespective of anything then b's same here irrespective of anything and then c's so answer should be axbycz where x,y,z>=0. shayal chhabra answered Jul 31, 2016 • edited Jul 31, 2016 by Prashant. shayal chhabra comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Assuming that the last state( in the transition order ) is the final state ... The given PDA will accept the language {axbycz : x,y,z >=0} Please verify.. abby murali answered Nov 3, 2015 abby murali comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes wow! gr8 question can yu plz tell me from whr yu got this? anyways answer is (c) in this pda b must be greater or equal to 1 and else are no matter of concern abhishek14893 answered Oct 9, 2016 abhishek14893 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes I think the PDA accepts axbycz butx>=1 x,y >=0 owais2580 answered Oct 9, 2016 owais2580 comment Share Follow See all 0 reply Please log in or register to add a comment.
