Linear cellular automata with boundary conditions. www.depaul.edu/~wchin (2000) [1 citations — 0 self]
by William Chin, Barbara Cortzen, Jerry Goldman
http://www.depaul.edu/~wchin/lca.ps
Add To MetaCart
Abstract:
Traditionally, a cellular automaton is a system consisting of sites on a lattice, which correspond to cell processor memory having finite field elements as values, and which evolve synchronously over discrete time according to a given local interaction rule called the state transition function [10, 11]. At
Citations
| 298 | Theory of Self-Reproducing Automata – Neumann - 1966 |
| 31 | Algebraic properties of cellular automata – Martin, Odlyzko, et al. |
| 15 | Statistical Mechanics of Cellular Automata, Rev. Mod. Phys – Wolfram - 1983 |
| 9 | Linear cellular automata and Fischer automata – Sutner - 1997 |
| 6 | Linear Cellular Automata and De Bruijn Automata – Sutner - 1999 |
| 5 | Exact results for deterministic cellular automata with additive rules – Guan, He - 1986 |
| 5 | σ-automata and chebyshev-polynomials – Sutner - 2000 |
| 2 | Cellular Automata and Recurring Sequences in Finite Fields – Jen, Linear - 1988 |
| 1 | Methods of Representation Theory, vol.I – Curtis, Reiner - 1981 |
| 1 | de Bergh, Algebraic Properties of Linear Cellular Automata – LeBruyn, Van - 1991 |
