Theory of Computation Regular Languages and Finite Automata Finite Automata

Which of the following statement is/ are true?

1
The set of regular languages is closed under the intersection.
2
​The set of regular languages is closed under the subset.
3

The set of regular languages is not closed under union.

4
The set of regular languages are closed under Kleen closure.

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters