\(\sigma\)-Automata and Chebyshev-polynomials (Q1978501): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q616505 |
Changed an Item |
||
| Property / author | |||
| Property / author: Klaus Sutner / rank | |||
Normal rank | |||
Revision as of 05:16, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(\sigma\)-Automata and Chebyshev-polynomials |
scientific article |
Statements
\(\sigma\)-Automata and Chebyshev-polynomials (English)
0 references
4 June 2000
0 references
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.
0 references
Additive cellular automata
0 references
Binary Chebyshev polynomials
0 references
Shift register sequences
0 references
