更改

删除8字节 、 2021年7月28日 (三) 17:46
第523行: 第523行:  
[[File:State diagram 3 state busy beaver 2B.svg|thumb|500px|right|The "3-state busy beaver" Turing machine in a [[Finite State Machine|finite state representation]]. Each circle represents a "state" of the table—an "m-configuration" or "instruction". "Direction" of a state ''transition'' is shown by an arrow. The label (e.g. '''0/P,R''') near the outgoing state (at the "tail" of the arrow) specifies the scanned symbol that causes a particular transition (e.g. '''0''') followed by a slash '''/''', followed by the subsequent "behaviors" of the machine, e.g. "'''P''' '''P'''rint" then move tape "'''R''' '''R'''ight". No general accepted format exists. The convention shown is after McClusky (1965), Booth (1967), Hill, and Peterson (1974).|链接=Special:FilePath/State_diagram_3_state_busy_beaver_2B.svg]]
 
[[File:State diagram 3 state busy beaver 2B.svg|thumb|500px|right|The "3-state busy beaver" Turing machine in a [[Finite State Machine|finite state representation]]. Each circle represents a "state" of the table—an "m-configuration" or "instruction". "Direction" of a state ''transition'' is shown by an arrow. The label (e.g. '''0/P,R''') near the outgoing state (at the "tail" of the arrow) specifies the scanned symbol that causes a particular transition (e.g. '''0''') followed by a slash '''/''', followed by the subsequent "behaviors" of the machine, e.g. "'''P''' '''P'''rint" then move tape "'''R''' '''R'''ight". No general accepted format exists. The convention shown is after McClusky (1965), Booth (1967), Hill, and Peterson (1974).|链接=Special:FilePath/State_diagram_3_state_busy_beaver_2B.svg]]
   −
"三态繁忙的海狸"图灵机的有限状态表示。每个圆圈代表表的一个 "状态"--一个 "m-配置 "或 "指令"。状态转换的 "方向 "用箭头表示。出状态附近的标签(如0/P,R)(在箭头的 "尾部")指定了引起特定转换的扫描符号(如0),后面是斜线/,接着是机器的后续 "行为",如 "P打印 "然后移动纸带 "R右"。没有普遍接受的格式存在。所显示的规则是以McClusky(1965)、Booth(1967)、Hill和Peterson(1974)为蓝本。
+
"三态繁忙的海狸"图灵机的有限状态表示。每个圆圈代表表的一个 "状态"--一个 "m-配置"或"指令"。状态转换的"方向"用箭头表示。出状态附近的标签(如0/P,R)(在箭头的"尾部")指定了引起特定转换的扫描符号(如0),后面是斜线/,接着是机器的后续 "行为",如“P打印”然后移动纸带"R向右"。没有普遍接受的格式存在。所显示的规则是以McClusky(1965)、Booth(1967)、Hill和Peterson(1974)为蓝本。
    
To the right: the above table as expressed as a "state transition" diagram.
 
To the right: the above table as expressed as a "state transition" diagram.
   −
右边:上面的表格表示为"状态转换 "图。
+
右边:上面的表格表示为"状态转换"图。
       
Usually large tables are better left as tables (Booth, p. 74). They are more readily simulated by computer in tabular form (Booth, p. 74). However, certain concepts—e.g. machines with "reset" states and machines with repeating patterns (cf. Hill and Peterson p. 244ff)—can be more readily seen when viewed as a drawing.
 
Usually large tables are better left as tables (Booth, p. 74). They are more readily simulated by computer in tabular form (Booth, p. 74). However, certain concepts—e.g. machines with "reset" states and machines with repeating patterns (cf. Hill and Peterson p. 244ff)—can be more readily seen when viewed as a drawing.
   −
通常大的表哥最好是留作表格(Booth,第74页)。它们更容易由计算机以表格形式模拟出来(Booth,p.74)。然而,某些概念,例如具有 "复位 "状态的机器和具有重复模式的机器(参见Hill和Peterson p. 244ff)在被视为图纸时更容易被看到。
+
通常大的表格最好是留作表格(Booth,p.74)。它们更容易由计算机以表格形式模拟出来(Booth,p.74)。然而,某些概念,例如具有 "复位 "状态的机器和具有重复模式的机器(参见Hill和Peterson p. 244)在被视为图纸时更容易被看到。
    
Whether a drawing represents an improvement on its table must be decided by the reader for the particular context. See Finite state machine for more.
 
Whether a drawing represents an improvement on its table must be decided by the reader for the particular context. See Finite state machine for more.
150

个编辑