-Automata and Chebyshev-polynomials

DOI10.1016/S0304-3975(97)00242-9zbMATH Open0947.68540OpenAlexW1502855729MaRDI QIDQ1978501FDOQ1978501

K. Sutner

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00242-9

Recommendations

• scientific article
• 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

zbMATH Keywords

Additive cellular automataBinary Chebyshev polynomialsShift register sequences

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Title not available (Why is that?)
• Algebraic coding theory
• Title not available (Why is that?)
• Linear cellular automata and the garden-of-eden
• Title not available (Why is that?)
• Algebraic properties of cellular automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
• Classifying circular cellular automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fermat's theorem for matrices

Cited In (27)

• Random Lights Out processes on graphs
• A family of multicolor lights out games
• Solutions to all-colors problem on graph cellular automata
• 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
• Note on the lamp lighting problem
• Minimum light number of lit-only \(\sigma\)-game on a tree
• Chasing the Lights in Lights Out
• Periodic binary harmonic functions on lattices
• On irreversibility of von Neumann additive cellular automata on grids
• On the Dimension of the Space of Harmonic Functions on a Discrete Torus
• A Survey of the Game “Lights Out!”
• Completely symmetric configurations for \(\sigma \)-games on grid graphs
• Title not available (Why is that?)
• Parity Dimension for Graphs - A Linear Algebraic Approach
• On the complexity of dominating set problems related to the minimum all-ones problem
• Generalized switch-setting problems
• Periodic harmonic functions on lattices and Chebyshev polynomials
• Cyclic mutually unbiased bases, Fibonacci polynomials and Wiedemann's conjecture
• Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\)
• The general \(\sigma \) all-ones problem for trees

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)