Prof. Busch - LSU1 NFAs accept the Regular Languages.
Non-Deterministic Automata Regular Expressions
NFAs accept the Regular Languages
Non Deterministic Automata