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:
“God is a being of transcendent and unlimited perfections: his nature therefore is incomprehensible to finite spirits.”
—George Berkeley (1685–1753)
““Hear me,” he said to the white commander. “I am tired. My heart is sick and sad. Our chiefs are dead; the little children are freezing. My people have no blankets, no food. From where the sun stands, I will fight no more forever.””
—For the State of Montana, U.S. public relief program (1935-1943)
“In Hell all the messages you ever left on answering machines will be played back to you.”
—Judy Horacek (b. 1961)