除了DFA有的 read、move、change state之外,还多了write操作
1 正式定义
1.1 转移方程
direction可以是tape向左、向右、不动
1.2 图表示图灵机
状态为q的时候,看到字符a,那么会转移到状态p,将字符a改成b,同时tape向左移动一格
1.3 图灵机的接受
当一个语言w到达过 ,那么图灵机就能接受这个语言
1.4 图灵机的拒绝
1.5 几个判断
1.5.1 Can the tape alphabet Γ be the same as the input alphabet Σ?
No. Σ never contains blank , but Γ always contains blank. So they cannot be equal.
1.5.2 Can a Turing machine contain just a single state?
No. Any Turing machine must contain two distinct states