0
2.3kviews
Give a formal definition of a Push Down Automata(PDA)
1 Answer
0
22views

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 an input aabaa, the PDA is represented as

$δ(S,a,z_0) =(S,az_0)$

δ(S,a,a) =(S,aa)

δ(S,b,a) =(A)

δ(A,a,a) =(A, ε)

$δ(A, ε,z_0)=(C, ε)$

enter image description here

Please log in to add an answer.

Continue reading...

The best way to discover useful content is by searching it.

Search