164 views
0 votes
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..???

1 Answer

Related questions

3 votes
3 votes
2 answers
1
0 votes
0 votes
1 answer
2
gateexplore asked Jun 11, 2023
412 views
Construct an NFA that will accept string of 0's, 1's and 2's beginning with a 0's followed by an odd number of 1's and ending with any number of 2's. Please give the answ...
0 votes
0 votes
0 answers
3
vishnu777 asked Nov 24, 2022
205 views
Can anyone explain what is the meaning of saying set of some languages is another language.Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which ...
1 votes
1 votes
1 answer
4