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: State (computer Science)
Famous quotes containing the words finite, state and/or machines:
“Any language is necessarily a finite system applied with different degrees of creativity to an infinite variety of situations, and most of the words and phrases we use are “prefabricated” in the sense that we don’t coin new ones every time we speak.”
—David Lodge (b. 1935)
“Chippenhook was the home of Judge Theophilus Harrington, known for his trenchant reply to an irate slave-owner in a runaway slave case. Judge Harrington declared that the owner’s claim to the slave was defective. The owner indignantly demanded to know what was lacking in his legally sound claim. The Judge exploded, ‘A bill of sale, sir, from God Almighty!’”
—For the State of Vermont, 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)