Definition 9.1
A Turing machine M is defined by
M = (Q,Σ,Γ,δ,q 0 , ,F),
where
Q is the set of internal states,
Σ is the input alphabet
Γ is the finite set of symbols called the tape alphabet,
δ is the transition function,
∈Γ is a special symbol called the blank,
q 0 ∈ Q is the initial state,
F ⊆ Q is the set of final states.
In the definition of a Turing machine, we assume that Σ ⊆ Γ – { }, that is,
A Turing machine M is defined by
M = (Q,Σ,Γ,δ,q 0 , ,F),
where
Q is the set of internal states,
Σ is the input alphabet
Γ is the finite set of symbols called the tape alphabet,
δ is the transition function,
∈Γ is a special symbol called the blank,
q 0 ∈ Q is the initial state,
F ⊆ Q is the set of final states.
In the definition of a Turing machine, we assume that Σ ⊆ Γ – { }, that is,