On Finite Monoids of Cellular Automata

DOI10.1007/978-3-319-39300-1_8zbMath1351.68174arXiv1601.05694MaRDI QIDQ3186476

Maximilien Gadouleau, Alonso Castillo-Ramirez

Publication date: 10 August 2016

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

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

zbMATH Keywords

invertible elements; cellular automaton; monoid; generating set

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

37B15: Dynamical aspects of cellular automata

Related Items

On the minimal number of generators of endomorphism monoids of full shifts, Cellular automata and finite groups, Elementary, finite and linear vN-regular cellular automata, Bounding the minimal number of generators of groups and monoids of cellular automata

Cites Work

• 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.
• Theory of cellular automata: a survey
• The rank of the endomorphism monoid of a uniform partition.
• 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 rank of the semigroup of transformations stabilising a partition of a finite set
• Groups and Monoids of Cellular Automata