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)
“... anything so delightful as Washington I have never seen elsewhere. There were a mingled simplicity and grandeur, a mingled state and quiet intimacy, a brilliancy of conversation—the proud prominence of intellect over material prosperity which does not exist in any other city of the Union.”
—M. E. W. Sherwood (1826–1903)
“If men do not keep on speaking terms with children, they cease to be men, and become merely machines for eating and for earning money.”
—John Updike (b. 1932)