compile Compile on the fly (Result shown in the box on the right.)
Transitions: (A tuple only separated by spaces will be converted to valid tuple automatically.)
(q0, 0) -> (q0, 0, R) (q0, 1) -> (q0, 1, R) (q0, _) -> (q1, _, L) (q1, 0) -> (q2, 1, L) (q1, 1) -> (q1, 0, L) (q1, _) -> (qf, 1, N) (q2, 0) -> (q2, 0, L) (q2, 1) -> (q2, 1, L) (q2, _) -> (qf, _, R)

All other transitions behave like transition number .
(Numbering for transition corresponds to order in the textarea above.
(Malformed transitions excluded!))
Sort transitions

This TM ...
calculates a partial function.
(The TM halts for every input and the word the head is pointing to is the result.)
decides a language.
(The TM is a decider / a total Turing machine: Halts for every input with 0 or 1)
accepts a language.
(The TM halts or loops.)
Comment:
The input is an binary number and the output this number increased by one.

(Every input resets the simulation!)
Input: Reset

(Every input resets the test!)
Word length: 0 < < 31 symbols.
Break simulation after steps and assume that the word is rejected.
START (BE CAREFUL: You can't stop a running test.)