0% found this document useful (0 votes)

93 views100 pages

Unit 4

This document describes Turing machines, which are theoretical models of computation consisting of an infinite tape and a read/write head. A Turing machine is formally defined as an 8-tuple that specifies its states, tape symbols, transition function, start/accept/reject states, and more. The transition function defines the machine's behavior by specifying the next state, symbol to write, and head movement based on the current state and symbol read. The machine halts when no transition is possible, accepting the input if it halts in an accept state and rejecting otherwise. An example is given of a Turing machine that accepts the language consisting of strings of as.

Uploaded by

abcd efgh

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

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

93 views100 pages

Unit 4

Uploaded by

abcd efgh

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

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

You are on page 1/ 100

18CSC301T – FORMAL

LANGUAGE AND AUTOMATA

3rd Year CSE

SRM IST, Ramapuram
Turing Machines
Introduction
• TM’s described in 1936
– Well before the days of modern computers but remains a
popular model for what is possible to compute on today’s
systems
– Advances in computing still fall under the TM model, so
even if they may run faster, they are still subject to the
same limitations
• A TM consists of a finite control (i.e. a finite state
automaton) that is connected to an infinite tape.

unit-4/Turning Machine 3
Turing Machine
• The tape consists of cells where each cell holds a symbol from the tape
alphabet. Initially the input consists of a finite-length string of symbols
and is placed on the tape. To the left of the input and to the right of the
input, extending to infinity, are placed blanks. The tape head is initially
positioned at the leftmost cell holding the input.

Finite control

… B B X 1 X2 … Xi Xn B B …

unit-4/Turning Machine 4
Turing Machine Details
• In one move the TM will:
– Change state, which may be the same as the current state
– Write a tape symbol in the current cell, which may be the
same as the current symbol
– Move the tape head left or right one cell
– The special states for rejecting and accepting take effect
immediately
• Formally, the Turing Machine is denoted by the 8-
tuple:
– M = (Q, , Γ, δ, q0, B, qa, qr)

unit-4/Turning Machine 5
Turing Machine Description
• Q = finite states of the control
•  = finite set of input symbols, which is a subset of Γ below
• Γ = finite set of tape symbols
• δ = transition function. δ(q,X) are a state and tape symbol X.
– The output is the triple, (p, Y, D)
– Where p = next state, Y = new symbol written on the tape, D =
direction to move the tape head
• q0= start state for finite control
• B = blank symbol. This symbol is in Γ but not in .
• qaccept = set of final or accepting states of Q.
• qreject = set of rejecting states of Q

unit-4/Turning Machine 6
Instantaneous Description
• Sometimes it is useful to describe what a TM does in terms of
its ID (instantaneous description), just as we did with the
PDA.
• The ID shows all non-blank cells in the tape, pointer to the
cell the head is over with the name of the current state
– use the turnstile symbol ├ to denote the move.
– As before, to denote zero or many moves, we can use ├*.
• For example, for the above TM on the input 10#10 we can
describe our processing as follows:
Ba10#10B ├ B1a0#10B ├ B10a#10B ├ B10#b10B ├ B10#b10B ├
B10#1b0B ├ B10#10bB ├ B10#1c0B ├* cB10#10B ├ Bf10#10B ├*
BXX#XXBl
• In this example the blanks that border the input symbols are
shown since they are used in the Turing machine to define
the borders of our input.
unit-4/Turning Machine 7
A Turing Machine
Tape
...... ......

Read-Write head
Control Unit

unit-4/Turning Machine 8
The Tape
No boundaries -- infinite length
...... ......

Read-Write head

The head moves Left or Right

unit-4/Turning Machine 9
...... ......

Read-Write head

The head at each time step:

1. Reads a symbol
2. Writes a symbol
3. Moves Left or Right
unit-4/Turning Machine 10
Example:
Time 0
...... a b a c ......

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

1. Reads a

2. Writes k
unit-4/Turning Machine 11
Time 1
...... a b k c ......

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

1. Reads
b f
2. Writes
3. Moves Right unit-4/Turning Machine 12
The Input String
Input string Blank symbol

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

head
Head starts at the leftmost position
of the input string
Are treated as left and right brackets for the
input written on the tape.
unit-4/Turning Machine 13
States & Transitions
Read Write
Move Left

a b,
q1 q2
L

Move Right

a b,
q1 q2
R
unit-4/Turning Machine 14
Example:
Time 1
...... a b a c ......

q1
curren
t state

a b,
q1 q2
R
unit-4/Turning Machine 15
Time 1
...... a b a c ......

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

q2
a b,
q1 q2
R unit-4/Turning Machine 16
Example:
Time 1
...... a b a c ......

Time
...... a b2 b c ......

q2
a b,
q1 q2
L unit-4/Turning Machine 17
Example:
Time 1
...... a b a c ......

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

q2
g,
q1 q2
R unit-4/Turning Machine 18
Determinism
Turing Machines are deterministic

Allowed Not
Allowed
a b, R q2 q2
a b, R
q1 q1
b d, q3 a d, q3
L L
No lambda transitions allowed
unit-4/Turning Machine 19
Partial Transition
Function
Example:
...... a b a c ......

a b, Allowed:
q2
R No transition
q1
for input symbol c
b d, q3
unit-4/Turning Machine 20
The machine halts if there are
Halting
no possible transitions to follow
Example:

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

a b, q2
R No possible transition
q1
HALT!!!
b d, q3
unit-4/Turning Machine 22
Final States
q1 q2 Allowed

q1 q2 Not
Allowed

• Final states have no outgoing transitions

• In a final state the machine halts

unit-4/Turning Machine 23
Turing Machines as Acceptors
• A Turing machine halts when it no longer has any
available moves. If it halts in a final state, it
accepts its input; otherwise, it rejects its
input.This is too easy, so let's repeat it in symbols:
• A Turing Machine T = (Q, , , , q0, #, F) accepts a
language L(M), where L(M) = (w +: q0w xiqfxj
for some qf F, xi, xj *}(Notice that this definition
assumes that the Turing machine starts with its
tape head positioned on the leftmost symbol.)
unit-4/Turning Machine 24
Turing Machines as Acceptors
• We said a Turing machine accepts its input if it
halts in a final state. There are two ways this
could fail to happen:
• The Turing machine could halt in a nonfinal
state, or The Turing machine could never stop
(in which case we say it is in an infinite loop. )
• If a Turing machine halts, the sequence of
configurations leading to the halt state is
called a computation.
unit-4/Turning Machine 25
Acceptance
If machine halts
Accept Input
in a final state

If machine halts
in a non-final state
Reject Input or
If machine enters
an infinite loop
unit-4/Turning Machine 26
Turing Machine Example
A Turing machine that accepts the language:
aa *

a a, R

q0 ,
q
L
1
unit-4/Turning Machine 27
Time 0 a a a

a a,
R

q0 ,
q
L
1
unit-4/Turning Machine 28
Time 1 a a a

a a,
R

q0 ,
q
L
1
unit-4/Turning Machine 29
Time 2 a a a

a a,
R

q0 ,
q
L
1
unit-4/Turning Machine 30
Time 3 a a a

a a,
R

q0 ,
q
L
1
unit-4/Turning Machine 31
Time 4 a a a

a a, Halt & Accept

q0 ,
q
L
1
unit-4/Turning Machine 32
Rejection Example

Time 0 a b a

a, R ,
q0 q
L
unit-4/Turning Machine 1 33
Time 1 a b a

No possible Transition
a a, Halt & Reject
R

q0 ,
q
L
unit-4/Turning Machine 1 34
Infinite Loop Example

b b,
L
a a,
R ,
q0 q
L
1
unit-4/Turning Machine 35
Time 0 a b a

b b, L
a a, R

q0 ,
q
L
1
unit-4/Turning Machine 36
Time 1 a b a

b b, L
a a, R

q0 ,
q
L
1
unit-4/Turning Machine 37
Time 2 a b a

b b, L
a a, R

q0 ,
q
L
1
unit-4/Turning Machine 38
Time 2 a b a

q0
Time 3 a b a

q0
Time 4 a b a

q0
Time 5 a b a

... Infinite Loop q0

unit-4/Turning Machine 39
Because of the infinite loop:

• The final state cannot be reached

•The machine never halts

•The input is not accepted

unit-4/Turning Machine 40
Another Turing Machine
Example n n
Turing machine for the language {a b }

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 41
Time 0 a a b b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 42
Time 1 x a b b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 43
Time 2 x a b b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 44
Time 3 x a y b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 45
Time 4 x a y b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 46
Time 5 x a y b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 47
Time 6 x x y b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 48
Time 7 x x y b

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 49
Time 8 x x y y

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 50
Time 9 x x y y

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 51
Time 10 x x y y

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 52
Time 11 x x y y

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 53
Time 12 x x y y

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 54
Time 13 x x y y

Halt & Accept

q4 y y, y y,
y y, R L
R ,
a a, R a a,
y, R q aL
q3 y 0 x, b y,L q
q 2
R L
1
x
unit-4/Turning Machine
x, 55
Observation:

If we modify the
machine for the language n n
{a b }

we can easily construct

a machine for the language n n n
{a b c }

unit-4/Turning Machine 56
Turing Machines as Language Acceptors-
Example 2
• Design a TM to recognize the language of
strings of the form 0n1n2n

unit-4/Turning Machine 57
Computing Functions
with
Turing Machines
A function f (w) has:

Domain: D Result Region: S

f (w)
w D f ( w)  S

unit-4/Turning Machine 59
A function may have many parameters:

Example: Addition function

f ( x, y )  x  y

unit-4/Turning Machine 60
Integer Domain

Decimal: 5

Binary: 101

Unary: 11111

We prefer unary representation:

easier to manipulate with Turing machines

unit-4/Turning Machine 61
Definition:

A function f is computable if
there is a Turing Machine M such that:

Initial configuration Final configuration

 w   f (w) 

q0 qf
initial state accept state

For all w D Domain

unit-4/Turning Machine 62
In other words:
A function f is computable if
there is a Turing Machine M such that:


q0 w  q f f ( w)

Initial Halts at Final

Configuration Configuration

For all w D Domain

unit-4/Turning Machine 63
Example
The function f ( x, y )  x  y is computable

x, y are integers

Turing Machine:

Input string: x0 y unary

Output string: xy 0 unary

unit-4/Turning Machine 64
x y

Start  1 1  1 0 1  1 

q0
initial state

The 0 is the delimiter that

separates the two numbers

unit-4/Turning Machine 65
x y

Start  1 1  1 0 1  1 

q0 initial state

x y

Finish  1 1  1 1 0 

q f final state
unit-4/Turning Machine 66
The 0 here helps when we use
the result for other operations

x y

Finish  1 1  1 1 0 

q f final state
unit-4/Turning Machine 67
Turing machine for function f ( x, y )  x  y

1  1, R 1  1, R 1  1, L