\(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
From MaRDI portal
Publication:672754
DOI10.1016/0304-3975(95)00091-7zbMath0872.68121OpenAlexW2032375758MaRDI QIDQ672754
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00091-7
Related Items (25)
On the Dimension of the Space of Harmonic Functions on a Discrete Torus ⋮ VLSI architecture of a cellular automata machine ⋮ Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids ⋮ “Lights Out” and Variants ⋮ Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices ⋮ Text compression using two-dimensional cellular automata ⋮ On a modular domination game. ⋮ On the complexity of dominating set problems related to the minimum all-ones problem ⋮ Generalized switch-setting problems ⋮ \(\sigma\)-Automata and Chebyshev-polynomials ⋮ The general \(\sigma \) all-ones problem for trees ⋮ Periodic binary harmonic functions on lattices ⋮ Construction of \(\sigma^+\)-game solutions on a rectangular grid ⋮ A singular quartic curve over a finite field and the trisentis game ⋮ On irreversibility of von Neumann additive cellular automata on grids ⋮ 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 ⋮ Chasing the Lights in Lights Out ⋮ Periodic harmonic functions on lattices and points count in positive characteristic ⋮ Solutions to all-colors problem on graph cellular automata ⋮ A Survey of the Game “Lights Out!” ⋮ Lights Out on graphs ⋮ Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs ⋮ Periodic harmonic functions on lattices and Chebyshev polynomials
Cites Work
This page was built for publication: \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
