Linear cellular automata and the garden-of-eden
From MaRDI portal
Publication:1812609
DOI10.1007/BF03023823zbMath0770.68094MaRDI QIDQ1812609
Publication date: 25 June 1992
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
68Q80: Cellular automata (computational aspects)
Related Items
Parity Dimension for Graphs - A Linear Algebraic Approach, Note on the lamp lighting problem, Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids, Lit-only \(\sigma \)-game on pseudo-trees, A note on Lights-Out-puzzle: parity-state graphs, \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata, Even poset and a parity result for binary linear code, A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs, The general \(\sigma \) all-ones problem for trees, Completely symmetric configurations for \(\sigma \)-games on grid graphs, Minimum light number of lit-only \(\sigma\)-game on a tree, Combinatorial properties of a general domination problem with parity constraints, A solitaire game played on 2-colored graphs, Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?, Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs, Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices, Computations on nondeterministic cellular automata, On a modular domination game., Parity dimension for graphs, Peg-solitaire, string rewriting systems and finite automata, \(\sigma\)-Automata and Chebyshev-polynomials, On the complexity of dominating set problems related to the minimum all-ones problem, Generalized switch-setting problems, Periodic binary harmonic functions on lattices, Lit-only sigma game on a line graph, Odd neighborhood transversals on grid graphs, Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
Cites Work
