Personal final notes for CSE 105 Theory of Computability. Not comprehensive – only like a final exam cheat sheet. Regular Expression Precedence: \((R)\) → \(R^{*}\) → \(R_{1} R_{2}\) → \(R_{1} \cup R_{2}\) \(\emptyset\) represents empty set; \(\epsilon\) represents empty string; \(R^+ \equiv RR^*\) Proving closure Given: What does it mean for L to be in class? e.g. \(L\)* a regular language, so given a DFA/NFA* \(M_L\) WTS: The result of applying the operation to \(L\) is still in this class.