Dynamics groups of asynchronous cellular automata (Q617317): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q60691988 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0808.1238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON ASYNCHRONOUS CELLULAR AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order Independence in Asynchronous Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to sequential dynamical systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylow p-Subgroups of the General Linear Group Over Finite Fields of Characteristic p / rank
 
Normal rank

Latest revision as of 17:11, 3 July 2024

scientific article
Language Label Description Also known as
English
Dynamics groups of asynchronous cellular automata
scientific article

    Statements

    Dynamics groups of asynchronous cellular automata (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2011
    0 references
    There are considered the \(\pi\)-independent cellular automata i.e. those automata having the set of periodic points independent of the order of the application of the local functions. This type of automata is such that the local functions permute the periodic points and these permutations generate the so called dynamics group. Of the 256 cellular automata rules only 104 are \(\pi\)-independent. The paper considers exactly the automata defined by these 104 rules and gives a classification of their periodic states. It appears that their dynamics groups are quotients of Coxeter groups. In particular there are studied asynchronous cellular automata whose dynamics groups are trivial and those having invertible rules. In fact 41 Wolfram rules are considered as representative among which 26 have trivial dynamics, 9 are invertible and 1 is both.
    0 references
    0 references
    sequential dynamics
    0 references
    cellular automaton
    0 references
    update rule
    0 references
    dynamics groups
    0 references
    Coxeter groups
    0 references
    periodic points
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references