Download presentation
Presentation is loading. Please wait.
Published byYulia Chandra Modified over 6 years ago
1
CSCI-2400 Models of Computation Costas Busch - RPI
2
Computation memory CPU Costas Busch - RPI
3
temporary memory input memory CPU output memory Program memory
Costas Busch - RPI
4
temporary memory input memory CPU Program memory output memory compute
Costas Busch - RPI
5
Automaton temporary memory Automaton input memory CPU output memory
Program memory Costas Busch - RPI
6
Different Kinds of Automata
Automata are distinguished by the temporary memory Finite Automata: no temporary memory Pushdown Automata: stack Turing Machines: random access memory Costas Busch - RPI
7
Finite Automaton temporary memory input memory Finite Automaton
output memory Example: Vending Machines (small computing power) Costas Busch - RPI
8
Pushdown Automaton Stack Push, Pop input memory Pushdown Automaton
output memory Example: Compilers for Programming Languages (medium computing power) Costas Busch - RPI
9
Turing Machine Random Access Memory input memory Turing Machine
output memory Examples: Any Algorithm (highest computing power) Costas Busch - RPI
10
Power of Automata Finite Automata Pushdown Automata Turing Machine
Less power More power Solve more computational problems Costas Busch - RPI
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.