1 votes 1 votes Realtime DPDA with Null Store,Real time DPDA with final state, DPDA with NULL store,DPDA with final state, NPDA Theory of Computation theory-of-computation pushdown-automata dpda npda + – Durgesh Singh asked Dec 10, 2017 Durgesh Singh 2.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Simply consider Realtime DPDA means DPDA which doesn’t have epsilon moves! Hence we cannot push or pop without having any symbol. Hence it is less powerful than normalDPDA. and acceptance by empty stack in DPDA(either realtime or normal) sometimes doesn’t follows prefix property hence it is less powerful than final state acceptance. Hence order is Realtime DPDA with Empty state < RT DPDA with final state < DPDA with empty state < DPDA with final state < NPDA Ashwin Kulkarni answered Dec 11, 2017 • selected Jan 11, 2018 by Durgesh Singh Ashwin Kulkarni comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes real time DPDA with null<real time DPDA WITH FINAL<DPDA with NULl<DPDA with final<NPDA abhishek tiwary answered Dec 10, 2017 abhishek tiwary comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments abhishek tiwary commented Dec 10, 2017 reply Follow Share A context-free language is said to be real-time strict if it is accepted by a real-time deterministic pushdown automaton with empty stack acceptance. 0 votes 0 votes abhishek tiwary commented Dec 10, 2017 reply Follow Share @ Rishabh Jain 1 every DPDA donot have same power acceptance by empty stack and final state both have different power 0 votes 0 votes Nancy Pareta commented Jul 25, 2018 reply Follow Share please explain it with reason is it due to prefix property? 0 votes 0 votes Please log in or register to add a comment.