Understanding The Computation Process
The following illustrates how the above PDA computes on different input strings. The subscript from the step symbol is here omitted.
(a) Input string = 0011. There are various computations, depending on the moment the move from state to state is made. Only one of these is accepting.
- (i) . The final state is accepting, but the input is not accepted this way as it has not been read.
- (ii) . No further steps possible.
- (iii) . Accepting computation: ends in accepting state, while complete input has been read.
(b) Input string = 00111. Again there are various computations. None of these is accepting.
- (i) . The final state is accepting, but the input is not accepted this way as it has not been read.
- (ii) . No further steps possible.
- (iii) . The final state is accepting, but the input is not accepted this way as it has not been (completely) read.
Read more about this topic: Pushdown Automaton
Famous quotes containing the words computation and/or process:
“I suppose that Paderewski can play superbly, if not quite at his best, while his thoughts wander to the other end of the world, or possibly busy themselves with a computation of the receipts as he gazes out across the auditorium. I know a great actor, a master technician, can let his thoughts play truant from the scene ...”
—Minnie Maddern Fiske (1865–1932)
“Language is a process of free creation; its laws and principles are fixed, but the manner in which the principles of generation are used is free and infinitely varied. Even the interpretation and use of words involves a process of free creation.”
—Noam Chomsky (b. 1928)