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

can an npda be converted to pda

0 votes
41 views
asked in Theory of Computation by (9 points) | 41 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 (9.2k 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

0 votes
0 answers
2
Is all ambiguous grammar could be converted to unambiguous?
asked 3 days ago in Compiler Design by Dhananjay15 (7 points) | 16 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
38,094 questions
45,587 answers
132,148 comments
49,122 users