\(\sigma\)-Automata and Chebyshev-polynomials (Q1978501): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Klaus Sutner / rank | |||
| Property / author | |||
| Property / author: Klaus Sutner / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3709901 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2762882 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4044675 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5690468 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic properties of cellular automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3813755 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fermat's theorem for matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5536376 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4373009 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multidimensional \(\sigma\)-automata, \(\pi\)-polynomials and generalised S-matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3805914 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear cellular automata and the garden-of-eden / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Classifying circular cellular automata / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(97)00242-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1502855729 / rank | |||
Normal rank | |||
Latest revision as of 10:06, 30 July 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
