in Theory of Computation edited by
411 views
0 votes
0 votes

what should be the answer of this question and why??

in Theory of Computation edited by
411 views

4 Comments

@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
0
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
1
i have one more doubt can we convert dpda into npda if yes please give some exapmle and if no then why???
0
0

Please log in or register to answer this question.