Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 14

SIMPLE

PDA
Presented by:
Rinm Asad, Sameer Ellahi
Presented to:
Sir Khurram
AGENDA

Topic 1

What is a
Simple PDA?
AGENDA

Topic 1 Topic 2
What is a Symbols
Simple PDA? used to
make a
Simple PDA
AGENDA

Topic 1 Topic 2 Topic 3

What is a Symbols used How to


Simple PDA? to make a construct a
Simple PDA Simple PDA?
AGENDA

Topic 1 Topic 2 Topic 3 Topic 4

What is a Symbols used How to Examples of


Simple PDA? to make a construct a Simple PDA
Simple PDA Simple PDA?
What is Simple PDA?
What is Simple PDA?
▪ PDA stands for Push Down Automata
▪ Simple PDA is a way to implement a DFA
▪ DFA is Deterministic Finite Automata
▪ In DFA, there is only one path for specific input from the
current to the next
▪ DFA doesn’t accept Null move.
Symbols in Simple PDA
Symbols in Simple PDA
▪ There are 4 types of symbols used in Simple PDA:
1. Start/Stop:

2. Reject/Accept/Push:

3. Pop:

4. Read:
Simple PDA Construction
Simple PDA Construction
Following are the basic steps to PDA Construction:
 States = Read Symbols
 Once the Read Symbols are made we decide the Final and Non-Final
State.

Accept Symbol Reject Symbol


Examples
Example
a
a,b
a b a a,b
1 2 3
b
b
b
a
b a,b
Start
a b a a,b
Accept

Reject Reject Reject Reject


Thank You
Any Questions?

You might also like