\(\sigma\)-Automata and Chebyshev-polynomials
type: Item
instance of: scholarly article
title: \(\sigma\)-Automata and Chebyshev-polynomials
zbMATH Open document ID: 0947.68540
DOI: 10.1016/S0304-3975(97)00242-9
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
review text: A \(\sigma\)-automaton is an additive, binary cellular automaton on a graph. For product graphs such as grids and cylinders, reversibility and periodicity properties of the corresponding \(\sigma\)-automaton can be expressed in terms of a binary version of Chebyshev polynomials. We give a detailed analysis of the divisibility properties of these polynomials and apply our results to the study of \(\sigma\)-automata.
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 1454281
zbMATH Keywords: Additive cellular automata
zbMATH Keywords: Binary Chebyshev polynomials
zbMATH Keywords: Shift register sequences
author: K. Sutner
MaRDI profile type: Publication
cites work: Q3709901
cites work: \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
cites work: Algebraic coding theory
cites work: Q4044675
cites work: Q5690468
cites work: Algebraic properties of cellular automata
cites work: Q3813755
cites work: Fermat's theorem for matrices
cites work: Q5536376
cites work: Q4373009
cites work: Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices
cites work: Q3805914
cites work: Linear cellular automata and the garden-of-eden
cites work: Classifying circular cellular automata
full work available at URL: s0304-3975(97)00242-9
OpenAlex ID: W1502855729
description: scientific article; zbMATH DE number 1454281