5) (5 pts) Prove that the class of regular languages is closed under complementation. That is if I is a regular language
Posted: Fri Jul 01, 2022 5:46 am
5) (5 pts) Prove that the class of regular languages is closed under complementation. That is if I is a regular language then I is also a regular language. Hint: Use the DFA M that recognizes L to construct a DFAM that recognizes L.