A representation of a simple Turing Machine as 5-Tuples and an implied blank tape.

3-State Beaver.tur

(1,0,1,R,2)
(1,1,1,L,3)
(2,0,1,L,1)
(2,1,1,R,2)
(3,0,1,L,2)
(3,1,1,N,H)

Adder.tur

0

(1,B,0,R,2)
(1,0,0,R,2)
(1,1,1,R,2)

(2,0,0,R,2)
(2,1,1,R,2)
(2,B,B,L,3)

(3,1,0,L,3)
(3,B,1,L,4)
(3,0,1,L,4)

(4,0,0,L,4)
(4,1,1,L,4)
(4,B,B,R,1) 

Simple.tur

(1,B,0,R,2)
(2,B,B,R,4)
(4,B,1,R,5)
(5,B,B,R,1)

Usage.txt

Usage: Turing Machine [{-f,--file} path]         Path to a file describing a Turing Machine
                      [{-t,--timeout} duration]  Time in milliseconds to wait after each instruction
                      [{-p,--print} print state] Only print to the screen whilst in the given state
                      [{-d,--pad} tape padding]  Pads the tape with a given number of the tape default
                      [{-z,--zero}]              Fill the tape with 0's rather than blanks
                      [{-q,--quiet}]             Only print the final tape value on HALT
                      [{-h,--help}]              Display this message...