Finite State Machines
For a finite state machine, a configuration is simply the current state of the machine, together with the remaining input. The first configuration must be the initial state of and the complete input. A transition from a configuration to a configuration is allowed if for some input symbol and if has a transition from to on input . The final configuration must have the empty string as its remaining input; whether has accepted or rejected the input depends on whether the final state is an accepting state.
Read more about this topic: Computation History
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)
“Utah is the only State that gives condemned men a choice between death by hanging or before a firing squad. Most prisoners prefer the firing squad, but one obstinate convict in 1912 elected to be hanged because “hanging is more expensive to the state.””
—State of Utah, U.S. public relief program (1935-1943)
“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)