in Theory of Computation
179 views
2 votes
2 votes

in Theory of Computation
179 views

3 Comments

All are false.
3
3
How the first one is false when regular languages are closed on intersection.. Could you please explain
0
0
edited by

Yes regular languagaes are closed under finite union and intersection but they are not closed under infinite union and infinite intersection.

1
1

Please log in or register to answer this question.