Test by Bikram | Theory of Computation | Test 1 | Question: 10

Question

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

$L$, therefore, is:

• A. regular
• B. CFL but not regular
• C. CSL but not CFL
• D. none

Answer 1

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