0% found this document useful (0 votes)

141 views66 pages

Turing Machines: Costas Busch - LSU 1

1. A Turing machine is a computational model of algorithm execution that consists of a tape, a read/write head, finite state control, and a table of transitions between states. 2. The tape is infinite in both directions and divided into cells that can hold symbols. The head reads, writes, and moves left or right along the tape. 3. The machine operates by reading the symbol under the head, writing a new symbol, moving the head, and transitioning to a new state according to the transition table. 4. A Turing machine accepts or rejects an input string based on whether it halts in an accepting state or non-accepting state. It may also loop infinitely

Uploaded by

Elite Squad

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

141 views66 pages

Turing Machines: Costas Busch - LSU 1

Uploaded by

Elite Squad

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 66

Turing Machines

Costas Busch - LSU 1

The Language Hierarchy

n n n ?
a b c ww ?

Context-Free Languages
n n R
a b ww
Regular Languages
a* a *b *
Costas Busch - LSU 2
Languages accepted by
Turing Machines
n n n
a b c ww

Context-Free Languages
n n R
a b ww
Regular Languages
a* a *b *
Costas Busch - LSU 3
A Turing Machine
Tape
...... ......

Read-Write head
Control Unit

Costas Busch - LSU 4

The Tape

No boundaries -- infinite length

...... ......

Read-Write head

The head moves Left or Right

Costas Busch - LSU 5

...... ......

Read-Write head

The head at each transition (time step):

1. Reads a symbol
2. Writes a symbol
3. Moves Left or Right
Costas Busch - LSU 6
Example:
Time 0
...... a b a c ......

Time 1
...... a b k c ......

1. Reads a
2. Writes k
3. Moves Left
Costas Busch - LSU 7
Time 1
...... a b k c ......

Time 2
...... a f k c ......

1. Reads b
2. Writes f
3. Moves Right
Costas Busch - LSU 8
The Input String

Input string Blank symbol

......   a b a c    ......

head

Head starts at the leftmost position

of the input string
Costas Busch - LSU 9
States & Transitions

Read Write
Move Left

q1 a  b, L q2

Move Right

q1 a  b, R q2
Costas Busch - LSU 10
Example:
Time 1
......   a b a c    ......

q1
current state

q1 a  b, R q2
Costas Busch - LSU 11
Time 1
......   a b a c    ......

Time 2
......   a b b c    ......

q1 a  b, R q2
Costas Busch - LSU 12
Example:
Time 1
......   a b a c    ......

Time 2
......   a b b c    ......

q1 a  b, L q2
Costas Busch - LSU 13
Example:
Time 1
......   a b a c    ......

Time 2
......   a b b c g   ......

q1   g, R q2
Costas Busch - LSU 14
Determinism
Turing Machines are deterministic

Allowed Not Allowed

a  b, R q2 a  b, R q2

q1 q1
q3 a  d, L q3
b  d, L

No lambda transitions allowed

Costas Busch - LSU 15
Partial Transition Function
Example:

......   a b a c    ......

q1
Allowed:
a  b, R q2
No transition
q1 for input symbol c
b  d, L q3
Costas Busch - LSU 16
Observation:
In order to accept an input string,
it is not necessary to scan all the
symbols in the string

Costas Busch - LSU 17

Halting

The machine halts in a state if there is

no transition to follow

Costas Busch - LSU 18

Halting Example 1:

......   a b a c    ......

q1 No transition from q1
HALT!!!

Costas Busch - LSU 19

Halting Example 2:

......   a b a c    ......

a  b, R q2
No possible transition
q1 from q1 and symbol c
b  d, L q3 HALT!!!
Costas Busch - LSU 20
Accepting States

q1 q2 Allowed

q1 q2 Not Allowed

•Accepting states have no outgoing transitions

•The machine halts and accepts

Costas Busch - LSU 21

Acceptance

If machine halts
Accept Input
string in an accept state

If machine halts
in a non-accept state
Reject Input or
string
If machine enters
an infinite loop
Costas Busch - LSU 22
Turing Machine Example

Input alphabet   {a , b }

Accepts the language: a*

a  a, R

  , L
q0 q1

Costas Busch - LSU 23

Time 0   a a a  

a  a, R

  , L
q0 q1

Costas Busch - LSU 24

Time 1   a a a  

a  a, R

  , L
q0 q1

Costas Busch - LSU 25

Time 2   a a a  

a  a, R

  , L
q0 q1

Costas Busch - LSU 26

Time 3   a a a  

a  a, R

  , L
q0 q1

Costas Busch - LSU 27

Time 4   a a a  

a  a, R Halt & Accept

  , L
q0 q1

Costas Busch - LSU 28

Rejection Example

Time 0   a b a  

a  a, R

  , L
q0 q1
Costas Busch - LSU 29
Time 1   a b a  

q0
No possible Transition
a  a, R Halt & Reject

  , L
q0 q1
Costas Busch - LSU 30
A simpler machine for same language
but for input alphabet   {a }

Accepts the language: a*

Costas Busch - LSU 31

Time 0   a a a  

Halt & Accept

Not necessary to scan input

Costas Busch - LSU 32

Infinite Loop Example
A Turing machine
for language a * b(a  b) *

b  b, L
a  a, R

  , L
q0 q1

Costas Busch - LSU 33

Time 0   a b a  

b  b, L
a  a, R

  , L
q0 q1

Costas Busch - LSU 34

Time 1   a b a  

b  b, L
a  a, R

  , L
q0 q1

Costas Busch - LSU 35

Time 2   a b a  

b  b, L
a  a, R

  , L
q0 q1

Costas Busch - LSU 36

Time 2   a b a  
q0
  a b a  

Infinite loop
Time 3
q0
Time 4   a b a  
q0

Time 5   a b a  
q0
Costas Busch - LSU 37
Because of the infinite loop:

•The accepting state cannot be reached