Nondeterministic Finite Automata

Nondeterministic version of the classic definition of automaton, characterizing Regular Languages.

They consist in the nondeterministic counterpart of DFAs.