0 votes 0 votes what should be the answer of this question and why?? Theory of Computation ace-test-series theory-of-computation + – garimanand asked Sep 25, 2018 • edited Mar 3, 2019 by I_am_winner garimanand 397 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Swapnil Naik commented Sep 25, 2018 reply Follow Share @minal Is it like because sometimes DPDA is not possible so we go for NPDA, hence it is better to say in general pda's are non deterministic. 0 votes 0 votes Hira Thakur commented Sep 25, 2018 reply Follow Share the general behaviour of the remaining machine is by default deterministic in nature(conversion is also possible in both the ways) but in PDA it's nondeterministic behaviour(NPDA),(expressive power of NDPA is more than DPDA), so it's NPDA which is nondeterministic in nature. 1 votes 1 votes garimanand commented Sep 25, 2018 reply Follow Share i have one more doubt can we convert dpda into npda if yes please give some exapmle and if no then why??? 0 votes 0 votes Please log in or register to add a comment.
