0 votes

Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true?

S1: Language L is regular.

S2: Complement of L is CFL.

S3: Complement of L is CSL.

S4: Reversal of L is CFL.

(a) Only S1 (b) Only S2 and S4

(c) Only S1 and S3 (d) All of these

which is the answer and why..???

S1: Language L is regular.

S2: Complement of L is CFL.

S3: Complement of L is CSL.

S4: Reversal of L is CFL.

(a) Only S1 (b) Only S2 and S4

(c) Only S1 and S3 (d) All of these

which is the answer and why..???