edited by
365 views
3 votes
3 votes

Let $L$ denote the language generated by the grammar $S \rightarrow 00T$, $T \rightarrow 11S \mid 11$.

If $S$ is the start symbol, then which among the following options is TRUE?

  1. $L = (0+1)^*$
  2. $L$ is regular but not $(0+1)^*$
  3. $L$ is context free but not regular
  4. $L$ is not context free
edited by

1 Answer

Answer:

Related questions

2 votes
2 votes
2 answers
1
Bikram asked Nov 26, 2016
391 views
The language $L =\{a^n \ b^n \mid n \geq 1\} \cup \{a^m \ b^{2m} \mid m \geq 1\}$ is:DCFLCFL but not DCFLNon-CFLRegular Language
6 votes
6 votes
2 answers
2
Bikram asked Nov 26, 2016
1,183 views
Given a regular grammar $G_1$ and a context free grammar $G_2$, the problem of deciding if $L(G_1)$ is a proper subset of $L(G_2)$ is:DecidableUndecidable but semi-decida...
0 votes
0 votes
1 answer
3
Bikram asked Nov 26, 2016
296 views
$G1$ and $G2$ are regular grammars and the language generated by any grammar $G$ is represented by $L(G)$. In this case, $L(G1) \cap L(G2) = \phi$ is a/an:Decidable prob...
0 votes
0 votes
1 answer
4
Bikram asked Nov 26, 2016
205 views
Recursive Enumerable Languages are NOT closed under :UnionIntersectionComplementHomomorphism