An NFA is a finite state machine where, for a particular state and input symbol, the machine can transition to zero, one or multiple next states. It is defined by five components.

Finite State Machines (FSMs) serve as a foundational model for representing the behaviour of systems that transition between discrete states in response to inputs. Their applicability ranges from ...