The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x

can an npda be converted to pda

0 votes
33 views
asked in Theory of Computation by (9 points) | 33 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.
commented by Loyal (8.1k points)
0
by pda you mean deterministic pda ?
commented by (197 points)

Please log in or register to answer this question.

← Prev. Qn. in Sub. Next Qn. in Sub. →
← Prev. Next →

Related questions

+1 vote
1 answer
3
How many variables does the following grammar have when converted to CNF?
asked Nov 18, 2017 in Theory of Computation by gari Active (3.2k points) | 98 views


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
Google+

Gatecse
35,484 questions
42,741 answers
121,445 comments
42,135 users