The Non-Equivalence of DFAs and NFAs

Original post: here. A review on a proof given in the book Introduction to Automata Theory, Languages, and Computation by Hopcroft and Ullman. The theorem is that Deterministic Finite Automata (DFAs) and Non-Deterministic Finite Automata (NFAs) are e...