Mod 5 ATC vtu

1. SUBJECT:AUTOMATA THEORY AND
COMPILER DESIGN
TOPIC:INTRODUCTION TO
TURNING MACHINE
SUBMITTED BY:
SHWETHA L
1KT21IS038
SKIT
SUBMITTED TO:
SINDHU MAM
DEPT OF ISE,
SKIT

2. INTRODUCING TURING MACHINES.
 Introduced by Alan Turing in 1936.
 A simple mathematical model of a computer.
 Models the computing capability of a computer.

3. DEFINITION
 A Turing machine (TM) is a finite-state machine
with an infinite tape and a tape head that can read
or write one tape cell and move left or right.
 It normally accepts the input string, or completes
its computation, by entering a final or accepting
state.
 Tape is use for input and working storage.

4. Turing machine Definition
A Turing machine is 7 tuple automata:
Μ = (Q, Σ, Γ, δ, qo, B, F)
Where
Q=is a finite set of states.
Σ =finite set of input symbol.
Г =finite nonempty set of tape symbol.
qo= the initial state.
B =special tape symbol representing blank.
F =is a final accepting state.
δ =the transition function of TM
δ: Q×Г→Q×Г × {L, R, N}