Regular Languages Closed Under Complement Proof

Here we show that regular languages are closed under complement, in that if L is a regular language, then L' (the set of all strings not in L) is also regular. We prove this by considering a DFA for L, then trying to construct a DFA for L' by swapping the final and non-final states. GoFundMe: https://www.gofundme.com/f/easy-theor... Patreon:   / easytheoryyt   Fourthwall: https://easy-theory-llc-shop.fourthwa... Problem Solving channel: ​⁠ @easytheoryprobsolve If you like this content, please consider subscribing to my channel:    / @easytheory   ▶ADDITIONAL QUESTIONS◀ 1. Are finite languages closed under complement? 2. What else about a DFA guarantees that swapping the final and non-final states works? (Hint: number of computations.)