Regular Language and Finite Automata|| (1 Mark)||MCQ||2020

Last Updated :
Discuss
Comments

Consider the following statements.
I. If L1 U L2 is regular, then both L1 and L2 must be regular.
II. The class of regular languages is closed under infinite union.
Which of the above statements is/are TRUE?

[GATE 2020|| MCQ|| 1-mark]


Both I and II

II only

Neither I nor II

I only

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE CS
Theory of Computation
GATE CS
Share your thoughts in the comments
Article Tags :