in Theory of Computation edited by
139 views
1 vote
1 vote

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
in Theory of Computation edited by
by
139 views

1 Answer

2 votes
2 votes
Best answer

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

selected by
Answer:

Related questions