Turing Machine

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

Implement a turing machine. After execution, print all of the infinite tape cells which were modified.

Start at the left most state. Halt when at state #.

A number means write that number to the tape. An arrow means move that direction on the tape. A letter means goto that state.

Example execution:
<pre>
A B
0 : 1&gt;B 1&lt;A
1 : 1&lt;B 1&gt;#
</pre>

State, tape, action:
A, (0), 1&gt;B
B, 1(0), 1&lt;A
A, (1)1, 1&lt;B
B, (0)11, 1&lt;A
A, (0)111, 1&gt;B
B, 1(1)11, 1&gt;#
#, 1111

<a href="http://en.wikipedia.org/wiki/Turing_Machine">http://en.wikipedia.org/wiki/Turing_Machine</a>

Options

exec is denied

now post-mortem time, all source codes will be revealed

Sample input:_

     A   B   C   D 
0 : 1>B 1<A 1># 1>D
1 : 1<B 0<C 1<D 0>A

Sample output:

10111111111111

Sample input:_

     A   B   C   D   E   F  
0 : 2>C 0>D 1<F 1<F 2>C 2>A
1 : 0>F 1<B 1>A 0>F 2>A 2<B
2 : 0<F 0<B 0># 2<C 0<B 0<D

Sample output:

2020202020202020202020202020202020202020202020202020202020202020202020202020202020202020202020220202020202202020202022121212120202212020202022120202020220202020202022121212001

Sample input:_

     A   B   C   D 
0 : 2<D 1>D 2>C 0>C
1 : 5>C 3>B 2>D 0<D
2 : 1<C 0<C 1>A 1<B
3 : 6>A 2>D 0>C 6<D
4 : 3<C 3># 2>D 0<B
5 : 4<A 6<A 5>A 0>D
6 : 5<A 5<C 6<C 4<D

Sample output:

02155202152052021002222022255520222520215520221522220225552052025202215202520215210222100222565221001521555555222152155555202521022220210012220100215221502100102220215222152022221523333331244536126100021641021021451245124441024441000102

Ranking

Ruby _

Python _

Arc _

JavaScript _

C _

D _

Haskell _

AWK _

Postscript _

z80 _

goruby _

Groovy _

Language Ranking_

return to the top page