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)
“The recent attempt to secure a charter from the State of North Dakota for a lottery company, the pending effort to obtain from the State of Louisiana a renewal of the charter of the Louisiana State Lottery, and the establishment of one or more lottery companies at Mexican towns near our border, have served the good purpose of calling public attention to an evil of vast proportions.”
—Benjamin Harrison (1833–1901)
“As machines become more and more efficient and perfect, so it will become clear that imperfection is the greatness of man.”
—Ernst Fischer (1899–1972)