Scribd
Upload
94 views20 pages

TM and AUTOMATA

This document provides an overview of Turing machines. It defines a Turing machine as a 7-tuple abstract model of computation that consists of a finite state control, tape, and head. It describes Turing machines as able to recognize formal languages like recursive and recursively enumerable languages. The document also discusses variants like multi-tape Turing machines and non-deterministic Turing machines, and provides examples of simple Turing machines.

Uploaded by

ssahana84
Copyright
© Attribution Non-Commercial (BY-NC)
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
94 views20 pages

TM and AUTOMATA

This document provides an overview of Turing machines. It defines a Turing machine as a 7-tuple abstract model of computation that consists of a finite state control, tape, and head. It describes Turing machines as able to recognize formal languages like recursive and recursively enumerable languages. The document also discusses variants like multi-tape Turing machines and non-deterministic Turing machines, and provides examples of simple Turing machines.

Uploaded by

ssahana84
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 20

TURING MACHINE

G.SELVAVINAYAGAM
PARK COLLEGE OF ENGINEERING AND TECHNOLOGY
AUTOMATA

• Abstract Model
• Labeled Directed Graph
• Consists of States and Transitions
• Used for Formal Language Processing
• 5-tuples (Q, , , q0, F)
TYPES OF AUTOMATA

• FINITE AUTOMATA
• PUSH DOWN AUTOMATA
• LINEAR BOUNDED AUTOMATA
• TURING MACHINE
GRAMMAR
• Defines Formal Language
• Gives pattern to Set of strings in Language
• Defined by 4-tuples (V, T, P, S)
V - NonTerminals
T - Terminals
P - Production / Rules
S - Start Symbol
TYPES OF GRAMMAR

• REGULAR GRAMMAR
• CONTEXT FREE GRAMMAR
• CONTEXT SENSITIVE GRAMMAR
• RECURSIVE GRAMMAR
FORMAL LANGUAGES & AUTOMATA

REGULAR LANGUAGE - FINITE AUTOMATA

CONTEXT FREE LANGUAGE - PUSHDOWN AUTOMATA

CONTEXT SENSITIVE LANGUAGE - LINEAR BOUNDED AUTOMATA

RECURSIVE LANGUAGE - TURING MACHINE


ALAN TURING
• Alan Turing, born at 23rd of june, 1912
• British Mathematician
FORMAL DEFINITION
Definition. A Turing machine is a 7-tuple (Q, , , , q0, qaccept, qreject)
where:

•Q is a set of states

 is a set of symbols (the alphabet)

 is a set of symbols that can be written in tape,    and   

•  is the Transition Function

•q0  Q is the initial state

• qaccept is the accepting state

• qreject is the rejecting state, qreject  qaccept


INFORMAL DESCRIPTION

Control

head

… Tape
a1 a2

The head:
cell •Reads the symbol from the cell it is pointing to, and
•Either:
•Writes a new symbol in the cell, or
•Moves one cell to the left or right
RECURSIVE LANGUAGE
&
RECURSIVELY ENUMERABLE LANGUAGE

Language – a subset of (*


Let x be the input for a TM M.
TM M decides language L if for any x

M(x) = “yes” if x is in L and M(x) = “no” if x is not it L.


If such M exists, L is called recursive language.

M accepts L if for any x in L M(x) = “yes”, and for x not in L M does not halt.
If such M exists, L is called recursively enumerable language.
FIRST TURING MACHINE
Construct a Turing machine such that:

• Input: a substring over the alphabet  ={a,b}, the


substring contains at least 1 character b
• The header is pointing to the first cell in tape
• When the Turing machine halts, the header must be
pointing to the first occurrence of b in the input

a b a  a b a 
THE “ERASER” TM

Construct a Turing machine that receives as input a


substring of a’s and replace each a for a blank space, 

a a a     
VARIANTS OF TM

• Multi-tape Turing Machine

• Non-deterministic Turing Machine

• Enumerator
MULTI-TAPE TURING MACHINE
• A Turing Machine with several tapes
• Every multi-tape Turing machine has an equivalent
single tape Turing machine.

0 1 0 1 0 B ......
M
a a a B ............

b aB ............
S # 0 1 0 1 0 # a a a # b a #B ............
tape 1 tape 2 tape 3
NON-DETERMINISTIC TURING
MACHINE

• At any point, next state and Tape Head movement can


not be determined uniquely

• Every non-deterministic TM has an equivalent


deterministic TM.
ENUMERATOR
• A TM with an attached printer

• The language enumerated by an enumerator is the


collection of all the strings that it eventually prints out.

Control

0 0 1 0 … Work tape
HILBERT’S PROBLEM

Hilbert’s problems:

In 1900, mathematician David Hilbert delivered a famous


address at the “International congress of Mathematicians in Paris.”
He proposed 23 mathematical problems.

Hilbert’s tenth problem:

Design an algorithm that tests whether a multi-variable


polynomial has an integral root.
THE CHURCH-TURING THESIS
Every computer algorithm can be
implemented as a Turing machine

Necessary to resolve Hilbert’s tenth problem

•In 1936, Church ( Calculas ) & Turing ( Machines ) defined ALGORITHM

•These TWO definition were shown to be EQUIVALENT

• In 1970, work of Martin Davis, Hilary Putnam, and Julia Robinson, Showed that
no algorithm exists for testing whether a polynomial Equation has integral roots.
TM CONSTRUCTION

1. TM for f(x) = x + 1

2.TM for f(x , y) = x + y

3.TM for f(x) = x - 1


THANK YOU

You might also like