A PDA is defined as a 7-tuple representation such as$(Q,є,δ,q_0,z_0,F,Γ)$

where

Q – Finite set of states

є- Input symbol

δ- Transition function

$q_0$- Initial state

$z_0$ – Bottom of the stack

F- Set of final states

Γ- Stack alphabet

PDA transitions are represented using the δ operator

Example:

For …