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)
“Navajo men and boys have an odd way of showing their friendship. When two young men meet at the trading post, a “Sing”, or a dance they greet each other, inquire about the health of their respective families, then stand silently some ten or fifteen minutes while one feels the other’s arms, shoulders, and chest.”
—Administration in the State of Ariz, U.S. public relief program (1935-1943)
“Gee, I wish we had one of them doomsday machines things.”
—Stanley Kubrick (b. 1928)