| Nondeterministic Finite Automata (NFA) | ||
That is, ( Note : subscript M can be dropped when the particular PDA M is understood. )
Language accepted by a PDA M
There are two alternative definiton of acceptance as given below. 1. Acceptance by final state : Consider the PDA |
||