Finite State Machines
The output of a sequential circuit or computer program at any time is completely determined by its current inputs and current state. Since each binary memory element has only two possible states, 0 or 1, the total number of different states a circuit can assume is finite, and fixed by the number of memory elements. If there are N binary memory elements, a digital circuit can have at most 2N distinct states. The concept of state is formalized in an abstract mathematical model of computation called a finite state machine, used to design both sequential digital circuits and computer programs.
Read more about this topic: Program State
Famous quotes containing the words finite, state and/or machines:
“Are not all finite beings better pleased with motions relative than absolute?”
—Henry David Thoreau (1817–1862)
“There is such a thing as caste, even in the West; but it is comparatively faint; it is conservatism here. It says, forsake not your calling, outrage no institution, use no violence, rend no bonds; the State is thy parent. Its virtue or manhood is wholly filial.”
—Henry David Thoreau (1817–1862)
“In Hell all the messages you ever left on answering machines will be played back to you.”
—Judy Horacek (b. 1961)