in Theory of Computation
937 views
0 votes
0 votes
in Theory of Computation
937 views

2 Comments

NPDA is more powerful than DPDA which means for every language for which a DPDA exist, there exists an NPDA but there are some languages that are accepted by NPDA but are not accepted by DPDA.
0
0
by pda you mean deterministic pda ?
0
0

Please log in or register to answer this question.

Related questions