in Theory of Computation
391 views
0 votes
0 votes
Is the family of regular languages closed under infinite intersection?
in Theory of Computation
391 views

2 Answers

0 votes
0 votes
Regular Language Are Closed Under Infinite Intersection Of Regular Language.( i think correct me if i am wrong)

 

Regular Language Are " NOT "  Closed Under Infinite Union Of Regular Language.

L1 = {ab}

L2 = {a2b2}

L3 = {a3b3}

.

.

.

Union(L1, L2, L3.................) = { anbn | n>1 }
0 votes
0 votes

No , the family of regular languages are not closed under infinite intersection.

https://gateoverflow.in/3078/proof-regarding-infinite-union-intesection

Related questions