search
Log In
0 votes
42 views
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..???
in Theory of Computation 42 views

1 Answer

2 votes

Related questions

0 votes
1 answer
2
125 views
is union of regular language and context free language always regular?
asked May 22, 2019 in Theory of Computation Hirak 125 views
0 votes
0 answers
3
72 views
Is subset of regular language is always recursively enumerable language?
asked Jan 9, 2019 in Theory of Computation Warrior 72 views
0 votes
1 answer
4
146 views
Construct a minimal DFA which accepts set of all strings over {a,b}, such that $1)$Second symbol from $RHS$ should be $‘a’$ $2)$Third symbol from $RHS$ should be $‘a’$
asked Dec 27, 2018 in Theory of Computation Lakshman Patel RJIT 146 views
...