PDA with acceptance through Empty Stack & acceptance through Final State
We can draw PDA with two types of acceptance….
1. Through Empty Stack
2. Through Final State
In empty stack acceptance, while reading € symbol from input tape, last Z0 will also get popped out from stack. It means now stack will be totally empty. And also in this case the last transition will not lead to final state (state will be similar to intermediate state only) performing POP operation. PDA designed with acceptance through empty stack doesn’t contain any final state.
In case of acceptance through final state, we are reading € symbol from input tape & have to perform No-operation on stack. So top of stack will remain Z0 only. And also, the last transition will lead to Final state performing No-OP.
#cfg #grammar #automatatheory #dfa #sppu #automata #computer #nfa #re #regular_expression #pda10 #final #empty