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)
Related Items (49)
Amorphous computing: examples, mathematics and theory ⋮ Peg-solitaire, string rewriting systems and finite automata ⋮ Parity Dimension for Graphs - A Linear Algebraic Approach ⋮ On the Dimension of the Space of Harmonic Functions on a Discrete Torus ⋮ Even poset and a parity result for binary linear code ⋮ Odd neighborhood transversals on grid graphs ⋮ Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids ⋮ “Lights Out” and Variants ⋮ Lit-only \(\sigma \)-game on pseudo-trees ⋮ Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices ⋮ Random Lights Out processes on graphs ⋮ Two-lit trees for lit-only \(\sigma \)-game ⋮ A counterexample to the lights out problem ⋮ On weight-one solvable configurations of the Lights Out puzzle ⋮ Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice ⋮ Unnamed Item ⋮ Lights Out On A Random Graph ⋮ On a modular domination game. ⋮ A note on Lights-Out-puzzle: parity-state graphs ⋮ 2D Triangular von Neumann Cellular Automata with Periodic Boundary ⋮ On the complexity of dominating set problems related to the minimum all-ones problem ⋮ A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs ⋮ Generalized switch-setting problems ⋮ \(\sigma\)-Automata and Chebyshev-polynomials ⋮ On weak odd domination and graph-based quantum secret sharing ⋮ \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata ⋮ The general \(\sigma \) all-ones problem for trees ⋮ A group-labeling version of the Lights Out game ⋮ Periodic binary harmonic functions on lattices ⋮ Construction of \(\sigma^+\)-game solutions on a rectangular grid ⋮ Lit-only sigma-game on nondegenerate graphs ⋮ Completely symmetric configurations for \(\sigma \)-games on grid graphs ⋮ Note on the lamp lighting problem ⋮ 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 ⋮ Lit-only sigma game on a line graph ⋮ Resolution of Conjectures Related to Lights Out! and Cartesian Products ⋮ Models of Domination in Graphs ⋮ Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? ⋮ Computations on nondeterministic cellular automata ⋮ Solutions to all-colors problem on graph cellular automata ⋮ Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs ⋮ A Survey of the Game “Lights Out!” ⋮ MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS ⋮ Parity dimension for graphs ⋮ Lights Out on graphs ⋮ Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs ⋮ Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
Cites Work
This page was built for publication: Linear cellular automata and the garden-of-eden
