8
Proof of Trakhtenbrot’s Theorem
•
Details:
•
M = (Q,
D
,
d
, q
0
, Q
a
)
–
states Q,
initial state q
0
2
Q,
accepting states Q
a
µ
Q
–
D
= {0, 1} = tape alphabet
–
d
= transitions
•
What is a computation C of M ?