效绵鼎 Turing-Machine Formalism A TM is described by: 1.A finite set of states (Q,typically). 2.An input alphabet(Σ，typically) 3.A tape alphabet (T,typically;contains >) 4. A transition function(δ，typically)) 5. A start state (qo,in Q,typically). 6. A blank symbol(B,in「-Σ，typically). u All tape except for the input is blank initially. 7. A set of final states (F Q,typically) 5Turing-Machine Formalism ◼ A TM is described by: 1. A finite set of states (Q, typically). 2. An input alphabet (Σ, typically). 3. A tape alphabet (Γ, typically; contains Σ). 4. A transition function (δ, typically). 5. A start state (q0 , in Q, typically). 6. A blank symbol (B, in Γ- Σ, typically). u All tape except for the input is blank initially. 7. A set of final states (F ⊆ Q, typically). 5