A Turing Machine is an accepting device which accepts the languages (recursively
enumerable set) generated by type 0 grammars. It was invented in 1936 by Alan
Turing.
Definition
A Turing Machine (TM) is a mathematical model which consists of an infinite length
tape divided into cells on which input is given. It consists of a head which reads the
input tape. A state register stores the state of the Turing machine. After reading an
input symbol, it is replaced with another symbol, its internal state is changed, and it
moves from one cell to the right or left. If the TM reaches the final state, the input string
is accepted, otherwise rejected.
A TM can be formally described as a 7-tuple (Q, X, ∑, δ, q 0, B, F) where −
Q is a finite set of states
X is the tape alphabet
∑ is the input alphabet
δ is a transition function; δ : Q × X → Q × X × {Left_shift, Right_shift}.
q0 is the initial state
B is the blank symbol
F is the set of final states
Variation of Turing Machine
Last Updated : 04 Oct, 2019
Prerequisite – Turing Machine
1. Multiple track Turing Machine:
A k-tack Turing machine(for some k>0) has k-tracks and one R/W head that reads
and writes all of them one by one.
A k-track Turing Machine can be simulated by a single track Turing machine
2. Two-way infinite Tape Turing Machine:
Infinite tape of two-way infinite tape Turing machine is unbounded in both directions
left and right.
Two-way infinite tape Turing machine can be simulated by one-way infinite Turing
machine(standard Turing machine).
3. Multi-tape Turing Machine:
It has multiple tapes and controlled by a single head.
The Multi-tape Turing machine is different from k-track Turing machine but
expressive power is same.
Multi-tape Turing machine can be simulated by single-tape Turing machine.
4. Multi-tape Multi-head Turing Machine:
The multi-tape Turing machine has multiple tapes and multiple heads
Each tape controlled by separate head
Multi-Tape Multi-head Turing machine can be simulated by standard Turing
machine.
5. Multi-dimensional Tape Turing Machine:
It has multi-dimensional tape where head can move any direction that is left, right, up
or down.
Multi dimensional tape Turing machine can be simulated by one-dimensional Turing
machine
6. Multi-head Turing Machine:
A multi-head Turing machine contain two or more heads to read the symbols on the
same tape.
In one step all the heads sense the scanned symbols and move or write independently.
Multi-head Turing machine can be simulated by single head Turing machine.
7. Non-deterministic Turing Machine:
A non-deterministic Turing machine has a single, one way infinite tape.
For a given state and input symbol has atleast one choice to move (finite number of
choices for the next move), each choice several choices of path that it might follow for a
given input string.
A non-deterministic Turing machine is equivalent to deterministic Turing machine.
Deterministic Turing Machines
Turing machines are a model of computation. It is believed that anything that
can be computed can be computed by a Turing Machine. The definition won’t
look like much, and won’t be used much; however, it is good to have a
rigorous definition to refer to. Def 1.1 A Turing Machine is a tuple (Q, Σ,
δ, s, h) where • Q is a finite set of states. It has the states s, qacc, qrej
. • Σ is a finite alphabet. It contains the symbol #. • δ : Q − {qacc,
qrej} × Σ → Q × Σ ∪ {R, L} • s ∈ Q is the start state, qacc is the
accept state, qrej is the reject state. We use the following convention: 1. On
input x ∈ Σ ∗ , x = x1 · · · xn, the machine starts with tape #x1x2 ·
· · xn#### · · · that is one way infinite. 2. The head is initially
looking at the xn. 3. If δ(q, σ) = (p, τ ) then the state changes from q to
p and the symbol σ is overwritten with τ . The head does not move. 4. If
δ(q, σ) = (p, L) then the state changes from q to p and the head moves Left
one square. overwritten with τ . The head does not move. (Similar for δ(q,
σ) = (p, R). 5. If the machine is in state h then it is DONE. 6. If the
machine halts in state qacc then we say M ACCEPTS x. If the machine halts in
state qrej then we say M REJECTS x.
