Scribd
Upload
73 views11 pages

Notation of Turing Machine

A Turing machine consists of a tape divided into cells that can hold symbols, and a machine that reads the symbols, writes new symbols to cells, and moves across the tape. The machine's state is described by what symbol it is reading, what it writes, and which direction it moves. This complete description at any step is called an instantaneous description. An example Turing machine is shown that takes a string of 1s on the tape and converts it to 0s before halting.

Uploaded by

Abhinav Vishwa
Copyright
© Attribution Non-Commercial (BY-NC)
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
73 views11 pages

Notation of Turing Machine

A Turing machine consists of a tape divided into cells that can hold symbols, and a machine that reads the symbols, writes new symbols to cells, and moves across the tape. The machine's state is described by what symbol it is reading, what it writes, and which direction it moves. This complete description at any step is called an instantaneous description. An example Turing machine is shown that takes a string of 1s on the tape and converts it to 0s before halting.

Uploaded by

Abhinav Vishwa
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 11

Notation of

Turing Machine
Turing Machine consists of a tape which is divided into
cells, each of which can hold a symbol from finite
number of input or tape symbols.
Initially the input symbols are put on the tape, remaining
symbols extending infinitely on the tape are assumed to
be blank.

Machine in a single ‘move’ does three works-


1. Changes State
2. Writes a Symbol in the cell scanned.
3. Moves the tape head
Formal Notation for Turing Machine

We describe Turing Machine by a 7-tupel Machine .


It is quite same as we have used for Finite automata.
Except the two symbols Blank and Tape symbols ,
which are the characteristics of Turing Machine.

Set of Tape Symbol


B : Blank Symbol is part of Tape Symbols but not of
input Symbols .This is the symbol which appears in all
but input symbol cells.
Instantaneous Description of Turing Machine

The complete state of a Turing machine at any point during a


computation may be described by the name of the state that the
machine is in, the symbols on the tape, and the cell that is currently
being scanned. A description of these three data is called an
instantaneous description of the computation.

Since a TM in principle has an infinitely long tape , therefore after any


number of moves, we can be on the same cell, or on the some finite
number of cells. Therefore in every ID, there is an infinite prefix
and suffix of cells that have never been visited.

Because blanks are present in all those cells which input symbols
aren’t there. Therefore a finite number of blank cells are also
included in the ID.
A Turing Machine

b 1 0

->q1 1Lq2 0Rq1 Null

q2 bRq3 0Lq2 1Lq2

q3 Null bRq4 bRq5

q4 0Rq5 0Rq4 1Rq4

q5 0Lq2 Null Null


An Example of Turing Machine
If read 1, write 0, go right, repeat.
If read 0, write 1, HALT!
If read , write 1, HALT!

1 1 1 1 0 1

6
An Example of Turing Machine
If read 1, write 0, go right, repeat.
If read 0, write 1, HALT!
If read , write 1, HALT!

0 1 1 1 0 1

7
An Example of Turing Machine
If read 1, write 0, go right, repeat.
If read 0, write 1, HALT!
If read , write 1, HALT!

0 0 1 1 0 1

8
An Example of Turing Machine
If read 1, write 0, go right, repeat.
If read 0, write 1, HALT!
If read , write 1, HALT!

0 0 0 1 0 1

9
An Example of Turing Machine
If read 1, write 0, go right, repeat.
If read 0, write 1, HALT!
If read , write 1, HALT!

0 0 0 0 0 1

10
An Example of Turing Machine
If read 1, write 0, go right, repeat.
If read 0, write 1, HALT!
If read , write 1, HALT!

0 0 0 0 1 1

11

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy