Chapter – 06
Turing Machine
The standard Turing Machine - Turing Machine as
machine accepters - Turing Machine as Transducers
– Universal Turing Machine
1
Introduction
•Alan Turing is father of this model. So its called as
Turing Machine
• It has the computing capability of general purpose
computer
• It has the following features:
– External memory
– Unlimited memory capability
– It reads the input on input tape from left to right
– Its maintaining the difference between the input and
output
2
Difference between the other automata and TM
•Unlimited input tape memory
•Unlimited external memory
•Finite control head can move on L to R and R to L
•It can differentiate the input and output by external symbol
•Output can write in the same input tape by external symbol
3
Turing Machine as Accepter
TM can be considered as Accepting device.
• Its accepting the set of strings.
• It accepts the family of languages generated by the grammar
type-0
Operation of TM:
• Inputs can keep in the tape from left to right and empty cells are
filled with blank symbol
• Depending upon the transition function it will change from one
state to another state
• After reading the input it will replace the input value by the
external symbol and It will move on left or right side based on
transition function
• When it reaches the final state, TM will accept the input so its
called accepter
4
Definition
M = ( Q, ∑, Γ, , q0, Z0, F )
Q – set of states
∑ - finite set of input symbols
Γ - finite set of external symbols
- transition function
(q0 , a) (q1, A, L)
This means reading input symbol ‘a’ in the
state q0. and it will go the state q1 by
replacing the ‘a’ by A in the tape and move
ahead to left(L) side on the tape
q0 - starting state belongs to Q
Z0 - blank symbol belongs to Γ
F – final state, belongs to Q
5
Cont.,
Example 6.1: Construct the TM for language which
accepts the string any number of 0’s and even number
of 1’s
First draw the FA for the above problem:
Draw the TM from FA:
6
Cont.,
7
TM as Transducer
8
Cont.,
9
Cont.,
10
Cont.,
11
Cont.,
12
Universal Turing Machine
It is a type of TM which is capable of doing anything that any other
TM can do. That means universal TM is a TM that imitates any TM
Features:
• UTM is a kind of TM can simulate any other TM
• UTM is a single machine used to compute any computable
sequence
• It can to manipulate an unbounded amount of data in finite
amount of time
13
Cont.,
14
Cont.,
15
Cont.
16
End of Chapter - 06
17
