Ranks of finite semigroups of one-dimensional cellular automata

DOI10.1007/s00233-016-9783-zzbMath1378.20062arXiv1510.00197OpenAlexW3104722361WikidataQ59474219 ScholiaQ59474219MaRDI QIDQ343476

Maximilien Gadouleau, Alonso Castillo-Ramirez

Publication date: 28 November 2016

Published in: Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

cellular automatafinite semigroupssmallest generating set

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05) Cellular automata (computational aspects) (68Q80) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (6)

Generating infinite monoids of cellular automata ⋮ On Finite Monoids of Cellular Automata ⋮ 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
• Unnamed Item
• Unnamed Item
• The minimal number of generators of a finite semigroup.
• Witt vectors and the algebra of necklaces
• Gardens of Eden and amenability on cellular automata
• Classical finite transformation semigroups. An introduction.
• Computation theory of cellular automata
• Amenable groups and cellular automata
• 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

This page was built for publication: Ranks of finite semigroups of one-dimensional cellular automata