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)
“Most of the folktales dealing with the Indians are lurid and romantic. The story of the Indian lovers who were refused permission to wed and committed suicide is common to many places. Local residents point out cliffs where Indian maidens leaped to their death until it would seem that the first duty of all Indian girls was to jump off cliffs.”
—For the State of Iowa, U.S. public relief program (1935-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)