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