The Gateway to Computer Science Excellence
0 votes
21 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 by (169 points) | 21 views

1 Answer

+2 votes
by Active (2.3k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,370 answers
198,506 comments
105,276 users