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:
“Are not all finite beings better pleased with motions relative than absolute?”
—Henry David Thoreau (1817–1862)
“Reporters for tabloid newspapers beat a path to the park entrance each summer when the national convention of nudists is held, but the cult’s requirement that visitors disrobe is an obstacle to complete coverage of nudist news. Local residents interested in the nudist movement but as yet unwilling to affiliate make observations from rowboats in Great Egg Harbor River.”
—For the State of New Jersey, U.S. public relief program (1935-1943)
“Shoes are the first adult machines we are given to master.”
—Nicholson Baker (b. 1957)