In an automata or formal-language problem, which option best represents regular languages closed under complement?

Correct Answer: C

the complement of a regular language is regular

In this course context, regular languages closed under complement means the complement of a regular language is regular.