Documente Academic
Documente Profesional
Documente Cultură
Curs 7
2014-15
LFAC (2014-15)
Curs 7
1 / 33
Curs 7
Masini Turing
LFAC (2014-15)
Curs 7
2 / 33
Curs 7
Masini Turing
LFAC (2014-15)
Curs 7
3 / 33
Definitie 1
Automatul pushdown M = (Q, , , , q0 , z0 , F ) este determinist daca
LFAC (2014-15)
Curs 7
4 / 33
Definitie 1
Automatul pushdown M = (Q, , , , q0 , z0 , F ) este determinist daca
(q1 , i, i) = {(q1 , )}
(q1 , , z) = {(q2 , )}
Curs 7
4 / 33
LFAC (2014-15)
Curs 7
5 / 33
LFAC (2014-15)
Curs 7
5 / 33
LFAC (2014-15)
Curs 7
6 / 33
Curs 7
Masini Turing
LFAC (2014-15)
Curs 7
7 / 33
|yu| 1
|yzu| n
xy i zu i v L, i 0
LFAC (2014-15)
Curs 7
8 / 33
|yu| 1
|yzu| n
xy i zu i v L, i 0
Urmatoarele
limbaje nu sunt de tip 2:
L = {an bn c n |n 1}
L = {an bm an bm |n 1}
L = {ai bj c k |i 6= j, k si j 6= k }
L = {ww|w {a, b} }
LFAC (2014-15)
Curs 7
8 / 33
Masini Turing
Curs 7
Masini Turing
LFAC (2014-15)
Curs 7
9 / 33
Masini Turing
Masini Turing
Alan Turing 1936
finit de stari
Numar
i
Banda de intrare este infinita n ambele part
Capul de citire se poate misca n ambele directii
Pe banda de intrare se pot citi si scrie simboluri
LFAC (2014-15)
Curs 7
10 / 33
Masini Turing
Curs 7
11 / 33
Masini Turing
LFAC (2014-15)
Curs 7
12 / 33
Masini Turing
LFAC (2014-15)
Curs 7
13 / 33
Masini Turing
LFAC (2014-15)
Curs 7
14 / 33
Masini Turing
LFAC (2014-15)
Curs 7
15 / 33
Masini Turing
LFAC (2014-15)
Curs 7
16 / 33
Masini Turing
LFAC (2014-15)
Curs 7
17 / 33
Masini Turing
LFAC (2014-15)
Curs 7
18 / 33
Masini Turing
LFAC (2014-15)
Curs 7
19 / 33
Masini Turing
LFAC (2014-15)
Curs 7
20 / 33
Masini Turing
LFAC (2014-15)
Curs 7
20 / 33
Masini Turing
LFAC (2014-15)
Curs 7
20 / 33
Masini Turing
LFAC (2014-15)
Curs 7
20 / 33
Masini Turing
LFAC (2014-15)
Curs 7
20 / 33
Masini Turing
LFAC (2014-15)
Curs 7
20 / 33
Masini Turing
LFAC (2014-15)
Curs 7
20 / 33
Masini Turing
LFAC (2014-15)
Curs 7
21 / 33
Masini Turing
LFAC (2014-15)
Curs 7
22 / 33
Masini Turing
Exemplu
M = ({q0 , q1 , q2 , q3 , q4 }, {a, b}, {a, b, x, y, B}, , q0 , {q4 })
L(M) = {an bn |n 1}
LFAC (2014-15)
Curs 7
23 / 33
Masini Turing
Exemplu
LFAC (2014-15)
Curs 7
24 / 33
Masini Turing
Exemplu
MT pentru L = {an bn c n |n 1}?
LFAC (2014-15)
Curs 7
25 / 33
Masini Turing
LFAC (2014-15)
Curs 7
26 / 33
Masini Turing
LFAC (2014-15)
Curs 7
27 / 33
Masini Turing
Turing-calculabila.
LFAC (2014-15)
Curs 7
28 / 33
Masini Turing
Probleme de decizie
o functie P : I F, I - multimea datelor
Problema algoritmica:
de intrare (instantelor problemei), F - multimea datelor finale, I, F
LFAC (2014-15)
Curs 7
29 / 33
Masini Turing
Probleme de decizie
problema computationala:
w , sa se obtina w R :
Dat un cuvant
P : , P(w) = w R
problema de decizie
LFAC (2014-15)
Curs 7
30 / 33
Masini Turing
Probleme decidabile
Limbaj asociat unei probleme de decizie: LP = {w I|P(w) = true}
Problema P este decidabila daca LP este recursiv (exista M cu
L(M) = LP , si M se opreste pentru toate cuvintele)
accept(M) = LP = {w I|P(w) = true}
reject(M) = {w I|P(w) = false}
LFAC (2014-15)
Curs 7
31 / 33
Masini Turing
Modele echivalente
LFAC (2014-15)
Curs 7
32 / 33
Masini Turing
LFAC (2014-15)
Curs 7
33 / 33