Scribd
Upload
14 views24 pages

Push Down Automata

Uploaded by

Rooh ul Hasnain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
14 views24 pages

Push Down Automata

Uploaded by

Rooh ul Hasnain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Topic: Push Down Automata

Presented by Shan Mazhar


Roll No : MSC-23F-004
Push down automata
A push down automata is a type of finite state
machine (FSM) that is used to recognize context free
languages as same implement of DFA for regular
language. It was introduced by the computer scientist
John Hopcroft in the 1960.A PDA is a theoretical
construct that operates on a formal language. It
consists of a finite set of states, a stack , an input tape ,
and accept

It is more powerful than FSM(finite state machine).
Finite state machine has a very limited memory but
PDA has more memory.
It is used stack data structure (LIFO).
PDA= finite state Machine + A stack
A stack is way we arrange elements one top of another.
A stack is a way we arrange element one top of another
Push: A new element is added at the top of the stack
Pop : The top element of the stack is read and
removed.
a
 Top
b

Stack
For push
 Top d

c
 Stack
For pop a
 Top
b

Stack
Component of push down automata
 A PDA is described by:
1. A finite set of states (Q, typically).
2. An input alphabet (Σ, typically).
3. A stack alphabet (Γ, typically).
4. A transition function (δ, typically).
5. A start state (q0, in Q, typically).
6. A start symbol (Z0, in Γ, typically).
7. A set of final states (F ⊆ Q, typically).

9
Actions of the Example PDA
000111

Z0

10
Actions of the Example PDA
00111

X
Z0

11
Actions of the Example PDA
0111

X
X
Z0

12
Actions of the Example PDA
111

X
X
X
Z0

13
Actions of the Example PDA
11

X
X
Z0

14
Actions of the Example PDA
1

X
Z0

15
Actions of the Example PDA

Z0

16
Actions of the Example PDA

Z0

17
Type of push down Automata
There are two types of push down automata
1. Non deterministic push down automata (NPDA)
2. Deterministic push down automata (DPDA)
Non deterministic push down automata (NDPA) : A
NDPA is a PDA that can be in multiple states at the
same time, and it can be transition with the same
input symbol and top of the stack.
Deterministic push down automata (DPDA): A DPDA
is a PDA that can only be in one state at a time , and it
can transition to top of the stack.
Deterministic Push down Automata
Use of PDA
Push down automata is used in several fields,
including computer science and artificial intelligence.
They are used to recognize and generate context –free
languages, which are used in natural language
processing and grammar analysis.
In computer science, push down automata are used to
design and analyze programming languages and
complier. They are also used in the theory of
computation to study the limits of computation and
the complexity of algorithms.
Conclusion
In summery, push down automata are type of
automata are a type of finite state machine that are
used to recognize context free language. They consist
of a finite set of states, a stack ,an input tape and a set
of transition rules. They are used in several fields,
including computer science and artificial intelligence.
It is important tools for studying the limits of
computation.

You might also like