Scribd
Upload
34 views21 pages

Turing Machines

Uploaded by

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

Turing Machines

Uploaded by

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

TURING MACHINES AND

COMPLEXITY
Introduction

• 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.


Design of Turing Machine
• 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.
Definition
• 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
Example of Turing machine
• Turing machine M = (Q, X, ∑, δ, q0, B, F) with
• Q = {q0, q1, q2, qf}
• X = {a, b}
• ∑ = {1}
• q0 = {q0}
• B = blank symbol
• F = {qf }
• 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.
• L = wwr, w∈(0,1)*

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