Professional Documents
Culture Documents
Turing Machine VS Pushdown Automata
Turing Machine VS Pushdown Automata
Turing Machine VS Pushdown Automata
PUSHDOWN AUTOMATA
GROUP MEMBERS:-
• HIMANSHU PANDEY(20)
• BHARAGAV PAWAR(46)
• NISHANT BHAT(41)
• ABHIJIY GAWAI(18)
• SHYAM KAWALE(27)
CONTENTS
Definition
Turing machine is a 5 tuple machine. A Turing
machine is a mathematical model of computation that
defines an abstract machine which manipulates symbols
on a strip of tape according to a table of rules. Despite it’s
simplicity ,turing machine can be adapted to simulate the
logic of any computer algorithm.
REPRESENTATION OF TURING MACHINE
δ(q,X)=(p,Y,R/L)
Alonzo Church
Allan
Turing
Several Variations of TM:
The language:
A ={< M, w >| M is a turing machine that
accepts w}
is turing recognizable.
M accepts w : Our algorithm will halt and accept
Where q is state in Q.
a is input alphabet.
x is stack alphabet
P is new state.
Y is stack alphabet that will replace X.
APPLICATION OF PUSHDOWN AUTOMATA
a,b=>c
A B
Graphical Definition -
Graphical Definition -
Turing machine VS Pushdown Automata
Turing machine PDA
Arguments Arguments
Output Output