A Nondeterministic Finite Automaton (NFA) is a theoretical machine used in computer science to represent and analyze the behavior of computational processes that can be in multiple states simultaneously. Unlike deterministic finite automata, NFAs allow for multiple transitions for a given input from a particular state, including epsilon transitions that do not consume any input symbol, making them a powerful model for defining regular languages.