Download - DocumentTm
![Page 1: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/1.jpg)
![Page 2: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/2.jpg)
![Page 3: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/3.jpg)
),,,,,,( 0 FqQM
States Input
alphabe
t
Tape
alphabet
Transition
function Initial
stateblank
The
Tape
Halt
![Page 4: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/4.jpg)
No boundaries -- infinite
length............
Read-Write head
The head moves Left or
Right
![Page 5: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/5.jpg)
............
Read-Write
headThe head at each transition (time
step):
1. Reads a symbol
2. Writes a symbol
3. Moves Left or Right
![Page 6: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/6.jpg)
............
Time 2
a b k c
............
a a cb
Time 1
1. Reads
2. Writes
a
k
3. Moves Left
![Page 7: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/7.jpg)
............
Time 2
a b k c
Time 3............
a k cf
1. Reads
2. Writes
b
f
3. Moves Right
![Page 8: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/8.jpg)
............
head
a b ca
Head starts at the leftmost position of the input string
Input stringBlank
symbol
![Page 9: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/9.jpg)
1q 2qLba ,
Read WriteMove Left
1q 2qRba ,
Move Right
![Page 10: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/10.jpg)
1q 2qRba ,
............
a b ca
Time 1
1q
current state
Example:
![Page 11: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/11.jpg)
............
a b ca
Time 1
1q 2qRg,
............
ga b cb
Time 2
1q
2q
Example:
![Page 12: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/12.jpg)
1q
2qRba ,
Allowe
d
Not Allowed
3qLdb ,
1q
2qRba ,
3qLda ,
No lambda transitions
allowed
![Page 13: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/13.jpg)
The machine halts in a state if there is
no transition to follow
![Page 14: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/14.jpg)
............
a b ca
1q
1q
2qRba ,
3qLdb , HALT !!!
Halting Example
No possible
transition
from and symbol1q c
![Page 15: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/15.jpg)
1q 2q Allowed
1q 2q Not Allowed
Accepting States
•Accepting states have no outgoing transitions
•The machine halts and accepts
![Page 16: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/16.jpg)
Accepts the language: *a
0q
Raa ,
L,1q
Input alphabet },{ ba
Turing Machine
Example
![Page 17: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/17.jpg)
aaTime 1
0q
a
0q
Raa ,
L,1q
![Page 18: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/18.jpg)
aaTime 2
0q
a
0q
Raa ,
L,1q
![Page 19: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/19.jpg)
aaTime 3
0q
a
0q
Raa ,
L,1q
![Page 20: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/20.jpg)
aaTime 4
0q
a
0q
Raa ,
L,1q
![Page 21: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/21.jpg)
aaTime 5
1q
a
0q
Raa ,
L,1q
Halt & Accept
![Page 22: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/22.jpg)
Rejection Example
0q
Raa ,
L,1q
baTime 1
0q
a
![Page 23: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/23.jpg)
0q
Raa ,
L,1q
baTime 2
0q
a
No possible Transition
Halt & Reject
![Page 24: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/24.jpg)
Transition Function
1q 2qRba ,
),,(),( 21 Rbqaq
1q 2qLdc ,
),,(),( 21 Ldqcq
![Page 25: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/25.jpg)
For any Turing Machine
M
}:{)( 210 xqxwqwML f
Initial state Accept state
![Page 26: DocumentTm](https://reader031.vdocument.in/reader031/viewer/2022020207/55943c121a28ab644c8b456d/html5/thumbnails/26.jpg)
If a language is accepted
by a Turing machine
then we say that is: M
L
L
•Turing Recognizable