Markov algorithm: Difference between revisions

Revision as of 03:15, 19 June 2006

Revision as of 11:00, 15 October 2006

Line 37:

==Another Example==

These rules give a more interesting example. They rewrite marked binary numbers to their unary counterparts. For example: a1101101101b101 will be rewritten to a string of 8775 consecutive onesbars.

===Rules===

#"0xb" -> "b0"

#"1xb|0" -> "b10||"

#"0x11" -> "10x0|"

#"0x00" -> "00x"

#"1x1" -> "11x"

===Symbol string===

#"1x0" -> "01x"

"101"

#"a0" -> "a0x"

#"a1" -> "a1x"

===Execution===

#"ab" -> "u"

If the algorithm is applied to the above example, it will terminate after the following steps.

#"u1" -> "1ju"

#"u0" -> "ju"

#"j1" -> "11j0|01"

#"j" -> "00||1"

#"u" -> "00||0|"

#"00|0|||"

#"000|||||"

#"00|||||"

#"0|||||"

#"|||||"

==References==