Beginner
Theory of Computation
Q19 / 100
What is the union of two regular languages?
Correct! Well done.
Incorrect.
The correct answer is B) A regular language (regular languages are closed under union)
B
Correct Answer
A regular language (regular languages are closed under union)
Explanation
Regular languages are closed under union, concatenation, Kleene star, intersection, and complement. The union of two regular languages is always regular.
Progress
19/100