Acceptance by final state
= Acceptance by final state
A <pushdown automaton> accepts a <word> if some finite run consumes all its input and reaches a designated final control state, regardless of the remaining <stack> contents. Reaching a final control state while leaving unread input is insufficient.