38 views

Give brief ans

| 38 views
0

test series questions should be provided by the source of test series questions @amit166

Obviously the complement of the set of finite languages will be an infinite set hence the given language L is not closed under complementation

by (734 points)
0
0

@satbir

Bro every finite language is regular. So L is a set of ALL regular languages and regular languages are closed under union,intersection & complementation right ? Is my thinking correct ?

0

https://gateoverflow.in/299897/common-careless-mistakes

@pranay562 see the 4th point.

Your logic is correct so d is correct.

But remember, set of regular languages are not closed under infinite union and infinite intersection.

0
yeah thanks bro
0

@satbir @pranay562

$finite \cup finite = finite$

$finite \cap finite = finite$

and when we take the complement of the set of finite languages then it will be an infinite set

https://gateoverflow.in/129942/theory-proof

In fact, it is the beauty of the question that it doesn't want to check your knowledge for closure properties

of regular languages but want to check your overall understanding of the concept.

But remember, set of regular languages are not closed under infinite union and infinite intersection.

Along with the infinite union and infinite intersection, regular languages are not closed under infinite

set-difference, subset operation and superset operation

0
ok so in this question closure property is wrt finiteness ?
0
yes