Appendix B: Minimum cost maximum length cellular automata for n = 100
Stanley L. Hurst · Institution of Engineering and Technology eBooks · 1998
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
Institution of Engineering and Technology eBooks · Institution of Engineering and Technology · paratext · 1998
Abstract
The following gives the positions in n-stage autonomous cellular automata of the type 150 cells necessary to produce a maximum-length sequence of 2n - 1 states. All remaining cells in the n-stage string of cells are the simpler type 90 cells.
Open the resolved locator · 10.1049/pbcs009e_appendixb
Metadata licence: OpenAlex metadata (CC0)