0 votes 0 votes Theory of Computation theory-of-computation pushdown-automata ace-test-series + – Na462 asked Jan 19, 2019 • edited Mar 3, 2019 by I_am_winner Na462 462 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Na462 commented Jan 19, 2019 reply Follow Share I have a doubt here : Initially we know that the Stack contain Zo as the Symbol, so when say symbol 'a' comes I should have configuration like d(A,a,Zo) = (...) but i dont have such configuration , so it will hault by rejecting the string. If i assume the top of stack to be empty also then also when say 'a' comes i will do d(A,a,^) = (A,a) , now when second 'a' comes i wont be having any configuration, so it will hault rejecting the string. Then how it will accept any of the language here :/ 0 votes 0 votes Psy Duck commented Sep 24, 2022 reply Follow Share ace made their own PDA ...ACPDA 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes D is the answer Deepalitrapti answered Oct 30, 2019 Deepalitrapti comment Share Follow See 1 comment See all 1 1 comment reply `JEET commented Oct 30, 2019 reply Follow Share Explanation? 0 votes 0 votes Please log in or register to add a comment.