Question
In an automata or formal-language problem, which option best represents regular languages closed under union?
Select an option. Your answer will be checked instantly.
Correct Answer: A. the union of two regular languages is also regular
Explanation:
In this course context, regular languages closed under union means the union of two regular languages is also regular.
Leave a Reply