Professional Documents
Culture Documents
CSC-4890 Introduction To The Theory of Computation: Slides With Thanks From Costas Busch Heorycomp/fall2015
CSC-4890 Introduction To The Theory of Computation: Slides With Thanks From Costas Busch Heorycomp/fall2015
Books
•John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Introduction to
Automata Theory, Languages, and Computation
Other stuff
My own lecture notes!!!
CPU memory
temporary memory
input
CPU
output
Program memory
temporary memory
input
CPU
output
Program memory
compute xx
2
compute x x
Costas Busch - LSU 6
3
f ( x) x
temporary memory
input
x2
CPU
output
Program memory
compute xx
2
compute x x
Costas Busch - LSU 7
3
temporary memory f ( x) x
z 2*2 4
f ( x) z * 2 8
input
x2
CPU
output
Program memory
compute xx
2
compute x x
Costas Busch - LSU 8
3
temporary memory f ( x) x
z 2*2 4
f ( x) z * 2 8
input
x2
CPU
f ( x) 8
Program memory output
compute xx
2
compute x x
Costas Busch - LSU 9
Automaton
temporary memory
Automaton
input
CPU
output
Program memory
Automaton
input
output
transition
state
results to
The solution of more computational
problems
temporary memory
input
Finite
Automaton
output
Example: Elevators, Vending Machines,
Lexical Analyzers
(small computing power)
Costas Busch - LSU 14
Pushdown Automaton
Temp.
memory Stack Push, Pop
Pushdown input
Automaton
output
Temp.
memory Random Access Memory
input
Turing
Machine
output
Answer: NO
(there are unsolvable problems)
Costas Busch - LSU 18
Time Complexity of Computational Problems:
P problems:
(Polynomial time problems)
NP-complete problems:
(Non-deterministic Polynomial time problems)
Believed to take exponential
time to be solved