Pages that link to "Item:Q1812609"

The following pages link to Linear cellular automata and the garden-of-eden (Q1812609):

Displaying 49 items.

• Amorphous computing: examples, mathematics and theory (Q272778) (← links)
• Random Lights Out processes on graphs (Q394801) (← links)
• On weak odd domination and graph-based quantum secret sharing (Q496043) (← links)
• Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids (Q596114) (← links)
• Lit-only \(\sigma \)-game on pseudo-trees (Q608278) (← links)
• A note on Lights-Out-puzzle: parity-state graphs (Q659666) (← links)
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata (Q672754) (← links)
• Even poset and a parity result for binary linear code (Q855546) (← links)
• A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
• The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
• Completely symmetric configurations for \(\sigma \)-games on grid graphs (Q976843) (← links)
• Minimum light number of lit-only \(\sigma\)-game on a tree (Q995589) (← links)
• Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
• A solitaire game played on 2-colored graphs (Q998506) (← links)
• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
• Maximum orbit weights in the \(\sigma \)-game and lit-only \(\sigma \)-game on grids and graphs (Q1043813) (← links)
• Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices (Q1128666) (← links)
• Computations on nondeterministic cellular automata (Q1283823) (← links)
• On a modular domination game. (Q1426455) (← links)
• Parity dimension for graphs (Q1584295) (← links)
• Peg-solitaire, string rewriting systems and finite automata (Q1885909) (← links)
• Two-lit trees for lit-only \(\sigma \)-game (Q1931720) (← links)
• \(\sigma\)-Automata and Chebyshev-polynomials (Q1978501) (← links)
• Construction of \(\sigma^+\)-game solutions on a rectangular grid (Q2008579) (← links)
• Lights Out on graphs (Q2088176) (← links)
• A group-labeling version of the Lights Out game (Q2238462) (← links)
• Lit-only sigma-game on nondegenerate graphs (Q2264032) (← links)
• Solutions to all-colors problem on graph cellular automata (Q2325123) (← links)
• Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774) (← links)
• On weight-one solvable configurations of the Lights Out puzzle (Q2424276) (← links)
• On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
• Generalized switch-setting problems (Q2461202) (← links)
• Periodic binary harmonic functions on lattices (Q2474258) (← links)
• Lit-only sigma game on a line graph (Q2519798) (← links)
• Odd neighborhood transversals on grid graphs (Q2643313) (← links)
• A Survey of the Game “Lights Out!” (Q2848975) (← links)
• On the Dimension of the Space of Harmonic Functions on a Discrete Torus (Q2911517) (← links)
• Models of Domination in Graphs (Q3384605) (← links)
• Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (Q3439135) (← links)
• “Lights Out” and Variants (Q4575440) (← links)
• Resolution of Conjectures Related to Lights Out! and Cartesian Products (Q4615413) (← links)
• 2D Triangular von Neumann Cellular Automata with Periodic Boundary (Q4631661) (← links)
• Parity Dimension for Graphs - A Linear Algebraic Approach (Q4796507) (← links)
• Lights Out On A Random Graph (Q5045960) (← links)
• MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS (Q5249044) (← links)
• Structure and Reversibility of 2D von Neumann Cellular Automata Over Triangular Lattice (Q5357164) (← links)
• (Q5883509) (← links)
• Note on the lamp lighting problem (Q5956771) (← links)
• A counterexample to the lights out problem (Q6081588) (← links)