Turing Machines: An Introduction

← Back to document page

Turing Machines: An Introduction Formally, a Turing machine is a 7-tuple, (Q,Σ,Γ,δ,q0,qaccept,qreject), where Q is the (finite) set of states, Σ is the input alphabet such that Σ does not contain the special blank symbol t, Γ is the tape alphabet is the transition function, q0 ∈ Q is the start state, qaccept ∈ Q is the

  Introduction, Machine, An introduction, Truing, Turing machines