Scribd
Upload
283 views

2.basic Model of Turing Machine

A Turing machine can be modeled with an infinite input tape containing cells with symbols, a finite control mechanism with a tape head that reads symbols and moves left/right, and a finite set of states and symbols to build the machine's logic.

Uploaded by

2224 Momynul Islam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
283 views

2.basic Model of Turing Machine

A Turing machine can be modeled with an infinite input tape containing cells with symbols, a finite control mechanism with a tape head that reads symbols and moves left/right, and a finite set of states and symbols to build the machine's logic.

Uploaded by

2224 Momynul Islam
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Basic Model of Turing machine

The turning machine can be modelled with the help of the following representation.

1. The input tape is having an infinite number of cells, each cell containing one input symbol
and thus the input string can be placed on tape. The empty tape is filled by blank
characters.

2. The finite control and the tape head which is responsible for reading the current input
symbol. The tape head can move to left to right.

3. A finite set of states through which machine has to undergo.

4. Finite set of symbols called external symbols which are used in building the logic of turing
machine.

You might also like