Академический Документы
Профессиональный Документы
Культура Документы
Theory
Dr.A.Bazila Banu
Bazila.banu@apu.edu.my
Computation
Automata
Computing Theory
What problems can a computer solve?
input n;
assume n>1; No one knows
Complexity while (n !=1) { whether this
if (n is even) terminates on
n := n/2; on all inputs!
else
n := 3*n+1;
Automata }
• RSA cryptography,
web applications
Computing Theory
Machines with finite memory:--
traffic signals, vending machines
Computability hardware circuits
Tractable.
Applications to pattern matching,
Complexity modeling,
verification of hardware, etc.
Automata
Computing Theory
C
Context-free
O . languages
M
P
L
E Automata
X
I
T
Y
N
I Computing Theory
C
R
E
A
S
Turing machines
I Context-free languages
N --- Grammars, parsing
G --- Finite state machines with recursion (or stack)
Context-free --- Still a simple setting; but infinite state
C
O . languages
M
P
L
E Automata
X
I
T
Y
N
I Computing Theory
C
R
E Turing machines (1940s):
A -- The most general notion of computing
S
Turing machines
-- The Church-Turing thesis
I -- Limits to computing:
N Uncomputable functions
G
C
Context-free
O . languages
M
P
L
E Automata
X
I
T
Y
Alonzo Church
• Formal proof!
You can convince a friend using a paper-
argument
Michael Sipser
Introduction to Theory
of Computation
(2nded; 1st ed may be ok)
Hopcroft-Ullman
How to do well…
– Don’t postpone learning; you will not be able to “make up” later.
Topics get quickly hard.
– Come regularly to discussion sections; you will learn a lot by
working out problems and learn from fellow students