\(\sigma\)-Automata and Chebyshev-polynomials (Q1978501)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: -Automata and Chebyshev-polynomials |
scientific article; zbMATH DE number 1454281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(\sigma\)-Automata and Chebyshev-polynomials |
scientific article; zbMATH DE number 1454281 |
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
0.8156978487968445
0 references
0.8129493594169617
0 references
0.7320870757102966
0 references
