Lecture 13 (Computation Theory) Turing Machine Variants

A Turing machine is defined as a 7-tuple (Q, Σ, Γ, δ, q₀, q_accept, q_reject). What is the required relationship between Σ and Γ?

1. A.Σ and Γ must be disjoint
2. B.Σ must equal Γ
3. C.Σ must be a subset of Γ, and the blank symbol must not be in Σ
4. D.Γ must be a subset of Σ, and the blank symbol must be in both