Talk:Universal Turing machine: Difference between revisions

Content added Content deleted
Line 5: Line 5:


Sort a tape containing arbitrary sequences of "a" and "b" alphabetically ("*" being blank symbol, "s0" initial state, "see" terminal state):
Sort a tape containing arbitrary sequences of "a" and "b" alphabetically ("*" being blank symbol, "s0" initial state, "see" terminal state):
<!-- DKF: language arbitrary, but gets right highlighting -->

("s0", "a", "s0", "a", right)
<lang java>("s0", "a", "s0", "a", right)

("s0", "b", "s1", "B", right)
("s0", "b", "s1", "B", right)

("s0", "*", "se", "*", left)
("s0", "*", "se", "*", left)

("s1", "a", "s1", "a", right)
("s1", "a", "s1", "a", right)

("s1", "b", "s1", "b", right)
("s1", "b", "s1", "b", right)

("s1", "*", "s2", "*", left)
("s1", "*", "s2", "*", left)

("s2", "a", "s3", "b", left)
("s2", "a", "s3", "b", left)

("s2", "b", "s2", "b", left)
("s2", "b", "s2", "b", left)

("s2", "B", "se", "b", left)
("s2", "B", "se", "b", left)

("s3", "a", "s3", "a", left)
("s3", "a", "s3", "a", left)

("s3", "b", "s3", "b", left)
("s3", "b", "s3", "b", left)

("s3", "B", "s0", "a", right)
("s3", "B", "s0", "a", right)

("se", "a", "se", "a", left)
("se", "a", "se", "a", left)
⚫
("se", "*", "see", "*", right)</lang>


⚫
Example: <tt>abbabbabababab</tt> => <tt>aaaaaabbbbbbbb</tt>
⚫
("se", "*", "see", "*", right)

⚫
Example: abbabbabababab => aaaaaabbbbbbbb


--[[User:Coenig|Coenig]] 14:11, 17 February 2013 (UTC)
--[[User:Coenig|Coenig]] 14:11, 17 February 2013 (UTC)
Retrieved from "https://rosettacode.org/wiki/Talk:Universal_Turing_machine"