Finite State Machine
Jiacun Wang, William M. Tepfenhart · 2019
The kinds of systems that finite state machines are good at describing include recognizers, classifiers, transducers, and generators. One of the powers of using a finite state machine to model certain types of systems is that it allows one to focus on issues one at a time. A finite state machine is a mathematical model of computation describing an abstract machine. While a machine, at any given time, is described by the current state within which it exists, the machine as whole is described by the set of states within which the machine can exist, the state within which the machine exists upon creation, the transitions that the machine can execute, and the inputs which the machine recognizes. The state machines consumes all input and ends up in a state which is not an accepting state, it is said that the state machine rejects that input stream.