Konsep Dasar Algoritma, Aturan Algoritma dalam Komputasi, Notasi Matematika di dalam Algoritma, Analisa Algoritma, Design Algoritma
Download
0.89 Mb.
Page
1/7
Date
20.03.2022
Size
0.89 Mb.
#58472
1
2
3
4
5
6
7
11-turing-machine
Navigate this page:
Turing Machine
Turing Machine
Didih rizki chandranegara
Turing Machine
Turing machine was invented in 1936 by
Alan Turing
. It is an accepting device which accepts Recursive Enumerable Language generated by type 0 grammar.
Type Grammar has been explained on
previous lessons about CNF or
https://en.wikipedia.org/wiki/Chomsky_hierarchy
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.
Download
0.89 Mb.
Share with your friends:
1
2
3
4
5
6
7
The database is protected by copyright ©ininet.org 2024
send message
Main page
Guide
Instructions
Report
Request
Review