Register

Grammer

522 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

1 votes
1 votes
1 answer
2
Na462 asked Sep 2, 2018
660 views
Ambiguity of Grammer
User Avatar
0 votes
0 votes
1 answer
3
K ANKITH KUMAR asked Jun 25, 2018
2,229 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
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 ...
User Avatar
0 votes
0 votes
1 answer
4
mrinmoyh asked Feb 1, 2018
608 views
Grammer
Can I give any grammer for the language L = { anbncn / n>=1} Like this----
Can I give any grammer for the language L = { anbncn / n>=1} Like this
User Avatar
Link Copied!