Limiting behaviour of linear cellular automata (Q1095664): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Cellular automata can generate fractals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Congruence properties of ordinary and q-binomial coefficients / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometry of Binomial Coefficients / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Statistical mechanics of cellular automata / rank | |||
Normal rank |
Latest revision as of 13:38, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Limiting behaviour of linear cellular automata |
scientific article |
Statements
Limiting behaviour of linear cellular automata (English)
0 references
1987
0 references
In the present paper the limiting behaviour of d-dimensional linear M- state cellular automata (d-LCA) is investigated. d-LCA are defined by local transition functions F of the type \[ F(x_ 1,x_ 2,...,x_ n)=\sum^{n}_{i=1}a_ ix_ i\quad (mod M)\quad, \] where \(a_ i,x_ i\in \{0,1,...,M-1\}\) and \(x_ i\) \((i=1,...,n)\) are the states of all neighbours of an arbitrary machine in the cellular structure. For the class of these automata the author shows that every d-LCA has a limit set of finite configurations. A detailed investigation of d-LCA can be found in the book [Parallel processing systems (V. Alad'ev (ed.)), Valgus Press. Tallinn (1983)].
0 references
limiting behaviour
0 references
cellular automata
0 references