non-deterministic finite automata being relatable

I'm having flashbacks to my theory to computation class. So much latex. So many proofs...