Example
The following is the formal description of the PDA which recognizes the language by final state:
, where
consists of the following six instructions:
, and .
In words, in state for each symbol read, one is pushed onto the stack. Pushing symbol on top of another is formalized as replacing top by . In state for each symbol read one is popped. At any moment the automaton may move from state to state, while it may move from state to accepting state only when the stack consists of a single .
There seems to be no generally used representation for PDA. Here we have depicted the instruction by an edge from state to state labelled by (read ; replace by ).
Read more about this topic: Pushdown Automaton
Famous quotes containing the word example:
“Our intellect is not the most subtle, the most powerful, the most appropriate, instrument for revealing the truth. It is life that, little by little, example by example, permits us to see that what is most important to our heart, or to our mind, is learned not by reasoning but through other agencies. Then it is that the intellect, observing their superiority, abdicates its control to them upon reasoned grounds and agrees to become their collaborator and lackey.”
—Marcel Proust (1871–1922)