WolframInstitute/TuringMachine

WolframInstitute`TuringMachine`

TuringMachineRuleCases

[{number,s,k}]

gives an association mapping each

{state,symbol}

to its transition triple

{nextState,writeSymbol,direction}

.

Details and Options

▪

The argument is a

{number,s,k}

rule: its enumeration number together with the state and color counts.

▪

Each value is a single transition

{nextState,writeSymbol,direction}

, where

direction

is

-1

for left and

1

for right; this is the deterministic counterpart of

, whose values are lists of triples.

Examples

(0)

SeeAlso

▪

▪

RelatedGuides

▪

The transition table of the s=2, k=2 rule 2:

In[1]:=

TuringMachineRuleCases

[{2,2,2}]

Out[1]=

{{1,0}{1,0,-1},{1,1}{1,0,-1},{2,0}{1,1,-1},{2,1}{1,0,-1}}

""