# Turing Machine Basics In Theory Of Automata

Last modified on May 26th, 2018 at 2:07 pm

**Turing Machine Basics:**

The Turing machine is an invention of a mathematician Alan Turing.

Turing machine is a very powerful machine. Any computer problem can be solved through Turing Machine.

Just like FA, Turing machine also has some states and some transition. Starting and ending states are also the part of Turing Machine.

Every transition on the states have 3 parts;

- Read
- Write
- Move

**Read:**

By read operation, machine can read any alphabet from the input tape; e.g, a,b,c,….x,y,z, 0,1 etc.

**Write:**

By Write operation, machine can write any alphabet; e.g, a,b,c,….x,y,z, 0,1 etc.

**Move:**

The move represents direction. Move tells where to move on input tape. e.g, if we say that move right, then it means that we need to move from one cell to the right cell on the input tape.

There are two types of the move;

Move left

Move right

**Explanation of diagram:**

There is in one little part of a Turing machine in the last figure. Let’s explain it;

**Start state: **

To start the machine

**a,a,R:**

Read a from input tape, Write a and then move one cell right on input tape.

**b,b,R: **

Read b from input tape, Write b, and then move one cell right on input tape.

**Accept:**

Machine successfully accept the string and Halts(Finish/complete).