A Non-Deterministic Automaton (NDA) is a theoretical computational model where multiple outcomes are possible from any given state and input. Unlike deterministic automata, NDAs can have multiple transitions for the same input or even transitions without any input, allowing them to explore many computational paths simultaneously.