Turing機械の高レベルな記述

! 
2
Turing
2
C
Turing
L={0k1k | k≥0}
0n1m
1. 
C
0
3
0
0
0
1
1
1
1
1
1
M1
C
C
Turing
L={0k1k | k≥0}
2.  0 1
3.  (0 1
0 1
0 1
! 
0
0
0
0
X
1
1
1
1
1
1
X
0
0
C
Turing
w
0
1
1
1
)
1
1
1
Turing
L={0k1k | k≥0}
M1
0n1m
1. 
0n1m
2.  0 1
0 1
! 
3.  0
0
M1
C
L={0k1k | k≥0}
M1=“
1. 
Turing
L={0k1k | k≥0}
M1
X
1
0
0
0
0
0
1
1
1
1
1
M2
C
C
Turing
L={0k1k | k≥0}
2.  0 1
3. 
M2
0 1
0 1
! 
0
! 
X
0
1
0
0
0
1 X
0
0
1
1
1
1
1
0
C
M2=“
1. 
0
0
0
0
1
1
1
1
1
C
Turing
L={0k1k | k≥0}
M2
w
2-1
! 
Turing
M1 M2
0n1m
2.  0 1
0 1
! 
! 
X
3. 
Turing
L={0k1k | k≥0}
M2
1
0 1
0
1 X
0
!
!
!

Download Report