Scribd
Upload
36 views2 pages

Pushdown Automata:: Basically, A Pushdown Automaton Is

A pushdown automaton is a finite state machine with an infinite stack that can remember an unbounded amount of information. It has states, input symbols, stack symbols, and transition functions that specify how it can read symbols and push or pop the stack. A pushdown automaton is formally defined as a 7-tuple that specifies its states, alphabets, stack symbols, transition function, initial state, initial stack symbol, and accepting states.

Uploaded by

REAL world
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views2 pages

Pushdown Automata:: Basically, A Pushdown Automaton Is

A pushdown automaton is a finite state machine with an infinite stack that can remember an unbounded amount of information. It has states, input symbols, stack symbols, and transition functions that specify how it can read symbols and push or pop the stack. A pushdown automaton is formally defined as a 7-tuple that specifies its states, alphabets, stack symbols, transition function, initial state, initial stack symbol, and accepting states.

Uploaded by

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

NAME:ZEESHAN MOHI UD DIN DAR ROLLNO:A26 REG.NO.

:11916426

Pushdown Automata:
A pushdown automaton is a way to implement a context-free grammar
in a similar way we design DFA for a regular grammar. A DFA can
remember a finite amount of information, but a PDA can remember an
infinite amount of information.

Basically, a pushdown automaton is −


"Finite state machine" + "a stack"
A pushdown automaton has three components −
 an input tape,

 a control unit, and

 a stack with infinite size.

The stack head scans the top symbol of the stack.


A stack does two operations −
 Push − a new symbol is added at the top.

 Pop − the top symbol is read and removed.

A PDA may or may not read an input symbol, but it has to read the
top of the stack in every transition.
A PDA can be formally described as a 7-tuple (Q, ∑, S,
δ, q0, I, F) −
 Q is the finite number of states
 ∑ is input alphabet
 S is stack symbols
 δ is the transition function: Q × (∑ ∪ {ε}) × S × Q ×
S*
 q0 is the initial state (q0 ∈ Q)
 I is the initial stack top symbol (I ∈ S)
 F is a set of accepting states (F ∈ Q)
NAME:ZEESHAN MOHI UD DIN DAR ROLLNO:A26 REG.NO.:11916426

You might also like