The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
24 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 (63 points) | 24 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 (1.7k points)

Related questions

0 votes
1 answer
3
asked Nov 3 in Theory of Computation by Na462 Loyal (6.7k points) | 36 views
0 votes
0 answers
5
0 votes
0 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

42,296 questions
48,419 answers
153,539 comments
62,661 users