Scribd
Upload
15 views16 pages

Cream and Brown Minimalist Accountant and Bookkeeper Marketing Presentation

Uploaded by

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

Cream and Brown Minimalist Accountant and Bookkeeper Marketing Presentation

Uploaded by

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

01

Automata
Theory
It was first introduced by Alan Turing
02
in 1930. A Turing machine (TM) is a
mathematical model of computation.
It is a language acceptor for the
class of languages known as

Turing
recursively enumerable languages.
Recursively enumerable languages
are also called Turing recognizable

Machine
languages.

A Turing machine is a finite automaton


that can read, write, and erase symbols
on an infinitely long tape. The tape is
divided into squares, and each square
contains a symbol. The Turing machine
can only read one symbol at a time, and
it uses a set of rules (the transition
function) to determine its next action
based on the current state and the
symbol it is reading.
03
04

A Turing machine is composed of an infinitely long tape on which reading and


writing operations can be carried out. The tape is divided into an infinite number
of cells, each of which holds either an input symbol or a special symbol called a
blank. Additionally, the machine has a head pointer that indicates the current
cell being read, and this head can move in both directions along the tape
05
06
07
08
09
Example Of Turing
Machine

aa
*
10
11
12
13
14
15
Accceptan
ce
If machine
Accept halts
Input
in a final
state
If machine halts
in a non-final
Reject state
Input or
If machine
enters
an infinite loop

You might also like