The map $3n+1$ is completely described by a 4-state Deterministic Finite-State Transducer (DFST) with a 16-entry transition table. A DFST is a machine that reads input symbol by symbol, maintains a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results