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:
“The finite is annihilated in the presence of the infinite, and becomes a pure nothing. So our spirit before God, so our justice before divine justice.”
—Blaise Pascal (1623–1662)
“The real stumbling-block of totalitarian régimes is not the spiritual need of men for freedom of thought; it is men’s inability to stand the physical and nervous strain of a permanent state of excitement, except during a few years of their youth.”
—Simone Weil (1909–1943)
“There are bills to be paid, machines to keep in repair,
Irregular verbs to learn, the Time Being to redeem
From insignificance.”
—W.H. (Wystan Hugh)