Editing Pushdown automaton (section)

=== Explanation ===
[[Image:Pda-steps.svg|thumb|214px|accepting computation for {{val|0011}}]]
The following illustrates how the above PDA computes on different input strings. The subscript {{mvar|M}} from the step symbol <math>\vdash</math> is here omitted.
{{ordered list|type=lower-alpha
|1= Input string = 0011. There are various computations, depending on the moment the move from state {{mvar|p}} to state {{mvar|q}} is made. Only one of these is accepting.
{{ordered list|type=lower-roman
| <math>(p,0011,Z) \vdash (q,0011,Z) \vdash (r,0011,Z)</math><br/>The final state is accepting, but the input is not accepted this way as it has not been read.
| <math>(p,0011,Z) \vdash (p,011,AZ) \vdash (q,011,AZ)</math><br/>No further steps possible.
| <math>(p,0011,Z) \vdash (p,011,AZ) \vdash (p,11,AAZ) \vdash (q,11,AAZ) \vdash (q,1,AZ) \vdash (q,\epsilon,Z) \vdash (r,\epsilon,Z)</math><br/>Accepting computation: ends in accepting state, while complete input has been read.}}
|2= Input string = 00111. Again there are various computations. None of these is accepting.
{{ordered list|type=lower-roman
| <math>(p,00111,Z) \vdash (q,00111,Z) \vdash (r,00111,Z)</math><br/>The final state is accepting, but the input is not accepted this way as it has not been read.
| <math>(p,00111,Z) \vdash (p,0111,AZ) \vdash (q,0111,AZ)</math><br/>No further steps possible.
| <math>(p,00111,Z) \vdash (p,0111,AZ) \vdash (p,111,AAZ) \vdash (q,111,AAZ) \vdash (q,11,AZ) \vdash (q,1,Z) \vdash (r,1,Z)</math><br/>The final state is accepting, but the input is not accepted this way as it has not been (completely) read.}}
}}