1 If we modify the machine for the language from F12 p. 47 we can easily construct a machine for the...
-
Upload
breanna-dry -
Category
Documents
-
view
232 -
download
1
Transcript of 1 If we modify the machine for the language from F12 p. 47 we can easily construct a machine for the...
1
If we modify the
machine for the language
from F12 p. 47
}{ nnba
we can easily construct
a machine for the language }{ nnn cba
Observation
Turing machine for the language
Turing Machine for the language
Turing machine Example from F12 p.47
}{ nnba
Rxa , Lyb ,Ryy ,2q
Laa ,Lyy ,
1q
Raa ,Ryy ,
Rxx ,0q3q
Ryy ,4q
L,##
1q 2qRxa , Ryb , Lzc ,
R
R
,
,
bb
zz
R,##
0q R,##
Ryy ,
Turing machine for the language
3q
Lzz
Lyy
Lbb
Laa
,
,
,
,
R
R
,
,
aa
yy
R
R
,
,
zz
yy
3q
Raa ,Ryy , Laa ,
abc string
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 0 # a b c #0q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 1 # a b c #1q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 2 # x b c #2q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 3 # x y c #3q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 4 # x y z #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 5 # x y z #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 6 # x y z #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 7 # x y z #1q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 8 # x y z #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 9 # x y z #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 10 # x y z #
3q
Raa ,Ryy , Laa ,
aabbcc string
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 0 # a a b b c c #0q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 6 # x a y b z c #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 10 # x a y b z c #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 11 # x a y b z c #
1q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 16 # x x y y z z #
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 20 # x x y y z z #1q
3q
Raa ,Ryy , Laa ,
1q 2qRxa ,
Ryy ,
0q
Ryy ,
Step 25 # x x y y z z #