ABSTRACT
A finite-state machine is a model of a sequential logic network. The term sequential indicates that its outputs are dependent not just on its current inputs, but also on past inputs. Therefore, a history of inputs must be kept. This is accomplished by the use of a memory. Rather than attempt to keep track of all past inputs, a finite number of states are used, each of which represents a set of equivalent input histories. Each input causes the machine to either enter a new state or stay in the same state, and may affect the machine's output. An electrical circuit for a finite-state machine includes inputs, a combinational logic part, a memory, and outputs as shown in Figure 2.1.
