Manuscript VII-F-ST@1 · VII-F-ST.tex · section · 9eee7a44

Constructive reversible realization

Exact geometry-only control and reversible finite encoding › Constructive reversible realization · lines 1059–1064

For each valid event word $g$ , let $f (g)$ be its outgoing word with permission decremented. There are $2^{r} - 1$ such input words.

Nearby in this section