1 / 14

# Máquinas de Turing - PowerPoint PPT Presentation

Máquinas de Turing. Tomado de Sudkamp: Languages and Machines Cap. 7. B/B L. B/B R. a/b R. a/a L. b/a R. b/b L. a a b a. b b a b. b b a b. b b a b. b a b a. b b a b. a a b a.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Máquinas de Turing' - linus

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Máquinas de Turing

Languages and Machines

Cap. 7.

B/B R

a/b R

a/a L

b/a R

b/b L

a a b a

b b a b

b b a b

b b a b

b a b a

b b a b

a a b a

b b a b

b b a b

b b a a

b b b a

q0

q2

q1

q2

q2

q2

q1

q1

q1

q1

q1

q2

q2

q0

Máquinas de Turing

M=(,Q,,,q0)

X/X R

Y/Y R

B/a L

a/a R

b/b R

a/a R

b/b R

B/B R

b/Y R

a/a L

b/b L

B/BL

B/B R

a/a R

b/b R

a/a R

b/b R

X/a L

Y/b L

q0

q2

q7

q4

q5

q1

q3

q6

Ejemplos de Máquinas de Turing

a/X R

B/b L

B/B L

a/a R

B/B R

a/a R

q0

q1

q2

q3

b/b R

M=(,Q,,,q0,F)

MT que acepta aibici

Y/Y R Z/Z R

B/B R

Y/Y R

a/X R

b/Y R

c/Z L

B/B R

a/a R Y/Y R

a/a L b/b L Y/Y L Z/Z L

b/b R Z/Z R

B/B R

q3

q2

q3

q1

q0

q4

q1

X/X R

b/b R

a/a R

B/B R

a/a R

q3

q1

q2

qf

q0

b/b R

B/B R

B/B R

B/B R

B/B R a/a R b/b R

M=(,Q,,,q0)

q2

’: Q-->Q{L,R}

q (multi-track)2

Máquina de Turing con cintas de doble sentido (two-way tape).

q (multi-track)2

Máquina de Turing con multi-cintas con lector pulpo (multitape).

: Qn-->Q({L,R})n

1 1

1 2 3

3 3 3

1/1 R

q1

q1

q1

q0

i/i L

B/1 L

B/B R

1/2 L

2/3 L

1

1 2

1

1 2

1

1

1

3

2

3

1 1

1 1

3

1

1

1 1

2

1 1

2

2

1 1

3

q2

q3

q0

q1

...

n/1 L

n-1/n L

q2

q1

q1

q1

q1

q1

q2

q2

q0

q3

q2

q1

q0

q2

q1

q0

q3

q0

q1

q0

q0

q2

q1

q0

q3

B/B R

B/B L

i/i R

a/a R b/b R c/c R (multi-track)

c/c R

a/a R

b/b R

B/b R

c/c L

a/a L

b/b L

q7

q1

q2

q3

q6

q0

q5

q4

M acepta las palabras que contengan una c seguida o precedida de ab.

Máquina de Turing no determinística

q1

1 3 2 1 1

Sucesión

d b c d

Simulación

a b c d

Input

Jerarquía de Chomsky (multi-track)

GRAMÁTICAS

LENGUAJES

AUTÓMATAS

Tipo 0,

Sin restriccciones

Recursivamente enumerables

Máquinas de Turing.

Tipo 1, Sensitivas al contexto. Monotonicas

Sensitivos al contexto

Independietes del contexto

Autómatas de Pila.

Tipo 3, Gramáticas regulares

Regulares

Autómatas finitos

AFD, AFND

1 1 (multi-track)

q3

q1

q0

1 1 1

1 1 1

q4

q2

c/Z R