A Turing machine is a 7-tuple, T=(Q, \Sigma, \Gamma, \delta, q_0, q_{accept}, q_{reject}), where

Question

A Turing machine is a 7-tuple,    T=(Q, \Sigma, \Gamma, \delta, q_0, q_{accept}, q_{reject}),   where

Accepted Answer

\delta : Q×\Gamma 	o Q×\Gamma×\{L,R\}   is the transition function

Answer

\Gamma  is the input alphabet

Answer

q_{reject} \in Q   is the reject state, where   q_{reject} = q_{accept}

Answer

\Sigma  is the input alphabet containing the blank symbol

Crowdly