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:
“Sisters define their rivalry in terms of competition for the gold cup of parental love. It is never perceived as a cup which runneth over, rather a finite vessel from which the more one sister drinks, the less is left for the others.”
—Elizabeth Fishel (20th century)
“D--n me, stranger, ef you can’t stay as long as you please, and I’ll give you plenty to eat and drink. Play away, stranger, you kin sleep on the dry spot tonight!”
—Administration in the State of Arka, U.S. public relief program (1935-1943)
“Gee, I wish we had one of them doomsday machines things.”
—Stanley Kubrick (b. 1928)