The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
18 views
If a language is accepted by PDA then it is Deterministic Context free language and if it is accepted by non deterministic then Context Free?
asked in Theory of Computation by Active (1.1k points) | 18 views
0
what u mean by non deterministic?

is it NFA?
0
I meant NPDA

1 Answer

0 votes
Not necessarily because the question does not mention what type of PDA, it could be Non-deterministic CFL.

If a language is accepted by deterministic PDA then it is definitely deterministic context free and if it is accepted by  Non-deterministic PDA then it is context free (Context free implies both deterministic and non-deterministic). As Non-deterministic PDA is more powerful, it can accept both DCFL and NCFL.
answered by Active (2.4k points)


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

40,903 questions
47,555 answers
146,274 comments
62,304 users