edited by
276 views
1 votes
1 votes

Consider the language $L =\{ ab^2 wb^3 / w$ is an element of $(a+b)^* \}$.

$L$, therefore, is:

  1. regular
  2. CFL but not regular
  3. CSL but not CFL
  4. none
edited by

1 Answer

Best answer
2 votes
2 votes

L is regular and following is respective regular expression abb(a+b)*bbb. hence A is correct answer!

selected by
Answer:

Related questions

6 votes
6 votes
2 answers
1
Bikram asked Nov 26, 2016
1,174 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
2
Bikram asked Nov 26, 2016
295 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
3
Bikram asked Nov 26, 2016
203 views
Recursive Enumerable Languages are NOT closed under :UnionIntersectionComplementHomomorphism
0 votes
0 votes
1 answer
4