0 votes 0 votes Consider following PDA WHICH OF FOLLOWING IS TRUE ABOUT LANGUAGE ACCEPTED BY IT ? A. Regular but infinite B. Regular but finite C. DCFL but not regular D. CFL but not DCFL Theory of Computation theory-of-computation pushdown-automata + – Na462 asked Sep 9, 2018 Na462 611 views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments srestha commented Sep 9, 2018 reply Follow Share @Shaik Is z always required for transition? what is minimum string here? It is not 011 but 11 can be. Then how it will be start with 0? See from peter linz , even 0 means empty stack, is transition with z required everywhere? 0 votes 0 votes Na462 commented Sep 10, 2018 reply Follow Share @ srestha Mam, The image is not clear though In pda for doing a state transition we look three things Current sate,input symbol and top of the stack and based on that information we do the state transition. If we take 11 then (Qo,1,Zo) no transition is defined. So the pda will crash and will reject the string. Because pda allow dead configuration. I too think string should start 0 and the minimum string should be 011. Please correct me if i am wrong somewhere :) 0 votes 0 votes Shaik Masthan commented Sep 10, 2018 reply Follow Share mam, post the clear image. 0 votes 0 votes Please log in or register to add a comment.