# Theorems 1 A language L is accepted by some DFA if and only if L is accepted by some NFA. 2 A language L is accepted by some e-NFA if and only if L is accepted by some DFA. 3 If L = L(A) for some DFA A, then there is a regular expression R such that L = L(R). 4 Every language defined by a regular expression is also defined by a finite automaton. 5 If L, M, and N are any languages then L(M U N) = LM U LN. 6 The Pumping Lemma for Regular Languages. 7 Closure Properties of Regular Languages. 8 Chomsky Normal Form 9 Context Free Grammar Prepare with ♥ from Mangesh.