Scribd
Upload
39 views2 pages

Turing Machine Introduction

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 is formally defined as a 7-tuple that includes the finite set of states, tape alphabet, input alphabet, transition function, initial state, blank symbol, and set of final states. A Turing machine can accept or reject strings based on whether it halts in a final state. It differs from finite automata and pushdown automata in that it has an infinite tape instead of a finite memory. An example Turing machine is given to demonstrate its components and transition function.

Uploaded by

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

Turing Machine Introduction

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 is formally defined as a 7-tuple that includes the finite set of states, tape alphabet, input alphabet, transition function, initial state, blank symbol, and set of final states. A Turing machine can accept or reject strings based on whether it halts in a final state. It differs from finite automata and pushdown automata in that it has an infinite tape instead of a finite memory. An example Turing machine is given to demonstrate its components and transition function.

Uploaded by

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

06.10.

2017 Tur ng Mach ne Introduct on

TURING MACHINE INTRODUCTION


https://www.tutorialspoint.com/automata_theory/turing_machine_introduction.htm Copyright © tutorialspoint.com

A Turing Machine is an accepting device which accepts the languages recursivelyenumerableset generated by
type 0 grammars. It was invented in 1936 by Alan Turing.

Definition
A Turing Machine T M 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 × {Left_shift, Right_shift}.

q0 is the initial state

B is the blank symbol

F is the set of final states

Comparison with the previous automaton

The following table shows a comparison of how a Turing machine differs from Finite Automaton and
Pushdown Automaton.

Machine Stack Data Structure Deterministic?

Finite Automaton N.A Yes

Pushdown Automaton Last In First OutLI F O No

Turing Machine Infinite tape Yes

Example of Turing machine

Turing machine M = (Q, X, ∑, δ, q0, B, F) with

Q = {q0, q1, q2, qf}

X = {a, b}
∑ = {1}

https://www.tutor alspo nt.com/cg -b n/pr ntpage.cg 1/2


06.10.2017 Tur ng Mach ne Introduct on

q0 = {q0}

B = blank symbol
F = {qf }

δ is given by −

Tape alphabet symbol Present State ‘q0’ Present State ‘q1’ Present State ‘q2’

a 1Rq1 1Lq0 1Lqf

b 1Lq2 1Rq1 1Rqf

Here the transition 1Rq1 implies that the write symbol is 1, the tape moves right, and the next state is q1.
Similarly, the transition 1Lq2 implies that the write symbol is 1, the tape moves left, and the next state is q2.

Time and Space Complexity of a Turing Machine


For a Turing machine, the time complexity refers to the measure of the number of times the tape moves when
the machine is initialized for some input symbols and the space complexity is the number of cells of the tape
written.

Time complexity all reasonable functions −

Tn = Onlogn

TM's space complexity −

Sn = On

https://www.tutor alspo nt.com/cg -b n/pr ntpage.cg 2/2

You might also like