Scribd
Upload
79 views

Types of TM

The document outlines various types of Turing machines, including Multi-Tape, Multi-Track, Non-Deterministic, and those with semi-infinite tapes. Each type is described with its formal definition, characteristics, and operational mechanisms. It emphasizes that all these variations have equivalent forms in standard Turing machines.

Uploaded by

solomonrathnam03
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
79 views

Types of TM

The document outlines various types of Turing machines, including Multi-Tape, Multi-Track, Non-Deterministic, and those with semi-infinite tapes. Each type is described with its formal definition, characteristics, and operational mechanisms. It emphasizes that all these variations have equivalent forms in standard Turing machines.

Uploaded by

solomonrathnam03
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

TYPES OF TURING MACHINES

1. Multi-Tape Turing Machines


2. Multi Track Turing Machines
3. Non Deterministic Turing Machines
4. A Turing Machine with a semi-infinite tape
5. A Turing Machine with a two-way infinite tape.

1. Multi-tape Turing Machines have multiple tapes where each tape is accessed with a
separate head. Each head can move independently of the other heads. Initially the
input is on tape 1 and others are blank. At first, the first tape is occupied by the input
and the other tapes are kept blank. Next, the machine reads consecutive symbols
under its heads and the TM prints a symbol on each tape and moves its heads.

A Multi-tape Turing machine can be formally described as a 6-tuple (Q, X, B, δ, q 0, F) where


−

 Q is a finite set of states


 X is the tape alphabet
 B is the blank symbol
 δ is a relation on states and symbols where
δ: Q × Xk → Q × (X × {Left_shift, Right_shift, No_shift })k
where there is k number of tapes
 q0 is the initial state
 F is the set of final states

Note − Every Multi-tape Turing machine has an equivalent single-tape Turing machine.
2. Multi-track Turing machines, a specific type of Multi-tape Turing machine, contain
multiple tracks but just one tape head reads and writes on all tracks. Here, a single
tape head reads n symbols from n tracks at one step. It accepts recursively enumerable
languages like a normal single-track single-tape Turing Machine accepts.

A Multi-track Turing machine can be formally described as a 6-tuple (Q, X, ∑, δ, q 0, F)


where −
 Q is a finite set of states
 X is the tape alphabet
 ∑ is the input alphabet
 δ is a relation on states and symbols where
δ(Qi, [a1, a2, a3,....]) = (Qj, [b1, b2, b3,....], Left_shift or Right_shift)
 q0 is the initial state
 F is the set of final states
Note − For every single-track Turing Machine S, there is an equivalent multi-track Turing
Machine M such that L(S) = L(M).

3. In a Non-Deterministic Turing Machine, for every state and symbol, there are a group
of actions the TM can have. So, here the transitions are not deterministic. The
computation of a non-deterministic Turing Machine is a tree of configurations that
can be reached from the start configuration.

An input is accepted if there is at least one node of the tree which is an accept configuration,
otherwi se it is not accepted. If all branches of the computational tree halt on all inputs,
the non-deterministic Turing Machine is called a Decider and if for some input, all branches
are rejected, the input is also rejected.
A non-deterministic Turing machine can be formally defined as a 6-tuple (Q, X, ∑, δ, q0, 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 → P(Q × X × {Left_shift, Right_shift}).
 q0 is the initial state
 B is the blank symbol
 F is the set of final states

4. A Turing Machine with a semi-infinite tape has a left end but no right end. The left
end is limited with an end marker.
It is a two-track tape −

 Upper track − It represents the cells to the right of the initial head position.
 Lower track − It represents the cells to the left of the initial head position in reverse
order.

The infinite length input string is initially written on the tape in contiguous tape cells.

The machine starts from the initial state q0 and the head scans from the left end marker ‘End’.
In each step, it reads the symbol on the tape under its head. It writes a new symbol on that
tape cell and then it moves the head either into left or right one tape cell. A transition function
determines the actions to be taken.

It has two special states called accept state and reject state. If at any point of time it enters
into the accepted state, the input is accepted and if it enters into the reject state, the input is
rejected by the TM. In some cases, it continues to run infinitely without being accepted or
rejected for some certain input symbols.

Note − Turing machines with semi-infinite tape are equivalent to standard Turing machines.

You might also like