Elementary, finite and linear vN-regular cellular automata (Q2201792): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2795531320 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.00511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank of the endomorphism monoid of a uniform partition. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Regular Group Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranks of finite semigroups of one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finite Monoids of Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Von Neumann regular cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular Automata and Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Group Ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Inverses in Associative Rings and Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of Elementary Cellular Automata Up to Topological Conjugacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of cellular automata: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a New K-Theoretic Theorem to Soluble Group Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on regular group rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2814774 / rank
 
Normal rank

Latest revision as of 14:58, 23 July 2024

scientific article
Language Label Description Also known as
English
Elementary, finite and linear vN-regular cellular automata
scientific article

    Statements

    Elementary, finite and linear vN-regular cellular automata (English)
    0 references
    17 September 2020
    0 references
    Let \(G\) be any group and \(A\) be any set. The set of all functions from \(G\) to \(A\) is denoted by \(A^G\). Let \(\operatorname{CA}(G; A)\) be the set of all CA over \(A^G\). A cellular automaton \(\tau\in\operatorname{CA}(G; A)\) is von Neumann regular (vN-regular) if there exists \(\sigma\in\operatorname{CA}(G; A)\) such that \(\tau\sigma\tau=\tau\). In the present paper, the authors are interested in the vN-regular elements in monoids of CA. The authors present some basic results and examples, and they establish that the monoid \(\operatorname{CA}(G; A)\) is not vN-regular. The authors obtain a partial classification of the vN-regular elementary CA over \(\{0, 1\}^{\mathbb{Z}}\). The authors prove that the monoid \(\operatorname{CA}(G; A)\) is vN-regular if and only if \(|G| = 1\) or \(|A| = 1\). The authors study whether elementary cellular automata (ECAs) are vN-regular. The authors prove that rules like 128 and 254 are vN-regular, while others, like the well-known rules 90 and 110, are not vN-regular. Then, the authors study the vN-regular elements of \(\operatorname{CA}(G; A)\) when \(G\) and \(A\) are both finite; in particular, the authors characterize them and describe a vN-regular submonoid. The vN-regular elements of the monoid \(\operatorname{LCA}(G; V)\) of linear CA are studied when \(V\) is a vector space over a field \(\mathbb{F}\). Let \(G\) be torsion-free elementary amenable (e.g., \(G =\mathbb{Z}^d\)), under some conditions the authors prove that \(\tau \in \operatorname{LCA}(G; \mathbb{F})\) is vN-regular if and only if it is invertible.
    0 references
    0 references
    cellular automata
    0 references
    elementary cellular automata
    0 references
    linear cellular automata
    0 references
    monoids
    0 references
    von Neumann regularity
    0 references
    generalised inverse
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references