Any Language created from a: Regular Expression Deterministic Finite Automaton Non-Deterministic Finite Automaton can be rewritten in each other’s form