The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
26 views
Let L(G) be the language generated by a context free grammar G.

Whether L(G) is deterministic context free language or not.

Is the above problem is decidable?
asked in Theory of Computation by (71 points) | 26 views
0
probably yes
0
How?

1 Answer

0 votes
Yes  , because for the language generated by cfl if we can design dpda (deterministic push down automata) then it is dcfl else it is not dcfl .
answered by Active (2.2k points)

Related questions

0 votes
0 answers
4
0 votes
2 answers
6


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

46,638 questions
51,132 answers
176,188 comments
66,551 users