The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
16 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.
asked in Theory of Computation by (133 points) | 16 views

1 Answer

0 votes
Option A

Language is regular
answered by (25 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

38,053 questions
45,544 answers
131,859 comments
48,884 users