-Automata and Chebyshev-polynomials
From MaRDI portal
Publication:1978501
Recommendations
- scientific article; zbMATH DE number 4074498
- Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
- Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
- scientific article; zbMATH DE number 1098621
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
Cites work
- scientific article; zbMATH DE number 3938573 (Why is no real title available?)
- scientific article; zbMATH DE number 4074498 (Why is no real title available?)
- scientific article; zbMATH DE number 4083539 (Why is no real title available?)
- scientific article; zbMATH DE number 3458752 (Why is no real title available?)
- scientific article; zbMATH DE number 1098621 (Why is no real title available?)
- scientific article; zbMATH DE number 3251532 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- Algebraic coding theory
- Algebraic properties of cellular automata
- Classifying circular cellular automata
- Fermat's theorem for matrices
- Linear cellular automata and the garden-of-eden
- Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
Cited in
(30)- Random Lights Out processes on graphs
- Chasing the lights in Lights Out
- Solutions to all-colors problem on graph cellular automata
- A family of multicolor lights out games
- A singular quartic curve over a finite field and the trisentis game
- Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids
- On weight-one solvable configurations of the Lights Out puzzle
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Periodic harmonic functions on lattices and points count in positive characteristic
- Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
- Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs
- Linear cellular automata with boundary conditions
- On the dimension of the space of harmonic functions on a discrete torus
- Equality of cycle lengths in one- and two-dimensional automata
- Note on the lamp lighting problem
- Minimum light number of lit-only \(\sigma\)-game on a tree
- Periodic binary harmonic functions on lattices
- On irreversibility of von Neumann additive cellular automata on grids
- A parameterized perspective of \textsc{all-colors}
- A Survey of the Game “Lights Out!”
- A parameterized perspective of \textsc{All-Colors}
- Completely symmetric configurations for \(\sigma \)-games on grid graphs
- scientific article; zbMATH DE number 4074498 (Why is no real title available?)
- On the complexity of dominating set problems related to the minimum all-ones problem
- Generalized switch-setting problems
- Parity Dimension for Graphs - A Linear Algebraic Approach
- Periodic harmonic functions on lattices and Chebyshev polynomials
- Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
- The general \(\sigma \) all-ones problem for trees
- Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
This page was built for publication: \(\sigma\)-Automata and Chebyshev-polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978501)
