The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
97 views
asked in Theory of Computation by (9 points) | 97 views
0
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
by pda you mean deterministic pda ?

Please log in or register to answer this question.

Related questions

0 votes
1 answer
2
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
47,925 questions
52,325 answers
182,358 comments
67,786 users