0 votes 0 votes Can we make NPDA? L= {anbn| n>=0,a,b are input variables} if yes then make it . Theory of Computation pushdown-automata npda + – akankshadewangan24 asked Jul 6, 2017 edited Jul 6, 2017 by Prashant. akankshadewangan24 2.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes DPDA $\subseteq$ NPDA Prashant. answered Jul 6, 2017 selected Dec 22, 2017 by Anu007 Prashant. comment Share Follow See all 5 Comments See all 5 5 Comments reply akankshadewangan24 commented Jul 6, 2017 reply Follow Share i have doubt in npda - can we transit from same state to same state with the operation of push and pop like (Q0 , x,y)==(Q0, xy)//push (Q0,x,y)===(Q0,epsilon)//pop on the same state ???????????????????/ 0 votes 0 votes Nitesh Choudhary commented Jul 6, 2017 reply Follow Share Yes you can write in npda At the time of string execution npda check all possible and for all possibility make a different copy of npda. 1 votes 1 votes Prashant. commented Jul 6, 2017 reply Follow Share Yes You can. 1 votes 1 votes akankshadewangan24 commented Jul 6, 2017 reply Follow Share in the above example there is no saparate npda right because dpda is subset of npda ? 0 votes 0 votes DAWID15 commented Nov 14, 2021 reply Follow Share But the above diagram doesn’t accept a empty string 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Yes we can make NDPDA. we can also make DPDA with acceptance using final state but we cannot make DPDA with acceptance using empty stack as Language L has prefix property. aaaakash001 answered Oct 6, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.