Scribd
Upload
33 views

Turing Machine

A Turing machine is a mathematical model of computation that consists of an infinite tape divided into cells, a head that reads and writes symbols on the tape, and a state register. It operates by reading a symbol, writing a new symbol, changing its state, and moving the head left or right. If the machine reaches an accepting state, the input is accepted, otherwise it is rejected. A Turing machine is formally defined as a 7-tuple describing its states, tape alphabet, transition function, initial state, blank symbol, and accepting states. It consists of a finite state control, tape head, and infinite tape.

Uploaded by

Satya Reddy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views

Turing Machine

A Turing machine is a mathematical model of computation that consists of an infinite tape divided into cells, a head that reads and writes symbols on the tape, and a state register. It operates by reading a symbol, writing a new symbol, changing its state, and moving the head left or right. If the machine reaches an accepting state, the input is accepted, otherwise it is rejected. A Turing machine is formally defined as a 7-tuple describing its states, tape alphabet, transition function, initial state, blank symbol, and accepting states. It consists of a finite state control, tape head, and infinite tape.

Uploaded by

Satya Reddy
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Turing Machine:

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.
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, ∑, δ, 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 → Q × X × {L, R, H}.
q0 is the initial state
B is the blank symbol
F is the set of final states

Schematic Diagram of Turing Machine:


A Turing machine consists of three parts:
1. The finite state control. This component is in one of a finite number of states at each instant,
and is connected to the tape head component.
2. The tape head. This component scans one of the tape squares of the tape at each instant, and is
connected to the finite state control. It can read and write symbols from/onto the tape, and it can
move left and right along the tape.
3. The tape. This component consists of an infinite number of tape squares, each of which can
store one of a finite number of tape symbols at each instant. The tape is infinite both to the left
and to the right.

You might also like