Page 1 of 1

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
by answerhappygod
5 5 Pts Prove That The Class Of Regular Languages Is Closed Under Complementation That Is If I Is A Regular Language 1
5 5 Pts Prove That The Class Of Regular Languages Is Closed Under Complementation That Is If I Is A Regular Language 1 (12.8 KiB) Viewed 32 times
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.