Register

Grammer

539 views
0 votes
0 votes
Which of the following problem is undecidable?

A) membership problem for CFL

B) membership problem for regular language

C)membership problem for csl

D)membership problem for type O language
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

814
views
0 answers
0 votes
MiNiPanda asked Jan 15, 2019
814 views
MadeEasy Test Series 2019: Theory of computation - Grammer
Let L be the language of all strings on [0,1] ending with 1.Let X be the language generated by the grammar G.$S \rightarrow 0S/1A/ \epsilon $A \rightarrow 1S ... end with 1. But is it so?Can't we generate 11 from the grammar?Please verify.
User Avatar
729
views
1 answers
1 votes
Na462 asked Sep 2, 2018
729 views
Ambiguity of Grammer
User Avatar
2.3k
views
1 answers
0 votes
K ANKITH KUMAR asked Jun 25, 2018
2,270 views
Grammer
A grammar will be meaningless of the(a) terminal set and non-terminal set are not disjoint(b) left hand side of a productions is a single terminal(c) left hand side of a production has no non-terminal(d) all of the above
User Avatar
659
views
1 answers
0 votes
mrinmoyh asked Feb 1, 2018
659 views
Grammer
Can I give any grammer for the language L = { anbncn / n>=1} Like this----
User Avatar
Link Copied!