Cellular automata and finite groups

DOI10.1007/s11047-017-9640-3zbMath1530.68160arXiv1610.00532OpenAlexW2953231447MaRDI QIDQ6191401

Alonso Castillo-Ramirez, Maximilien Gadouleau

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.00532

zbMATH Keywords

finite groupscellular automatagenerating setsfinite monoidsinvertible cellular automata

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Group actions on combinatorial structures (05E18)

Related Items (4)

The number of configurations in the full shift with a given least period ⋮ The relative rank of the endomorphism monoid of a finite \(G\)-set ⋮ On two Möbius functions for a finite non-solvable group ⋮ Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• Ranks of finite semigroups of one-dimensional cellular automata
• The minimal number of generators of a finite semigroup.
• Classical finite transformation semigroups. An introduction.
• Applied finite group actions.
• Theory of cellular automata: a survey
• The rank of the endomorphism monoid of a uniform partition.
• On Finite Monoids of Cellular Automata
• Idempotent rank in finite full transformation semigroups
• Cellular Automata and Groups
• On the ranks of certain finite semigroups of transformations
• Large semigroups of cellular automata
• THE AUTOMORPHISM GROUP OF A SHIFT OF LINEAR GROWTH: BEYOND TRANSITIVITY
• The rank of the semigroup of transformations stabilising a partition of a finite set
• Group Colorings and Bernoulli Subflows
• Groups and Monoids of Cellular Automata
• On the Möbius function of a finite group

This page was built for publication: Cellular automata and finite groups