Bounding the minimal number of generators of groups and monoids of cellular automata

DOI10.1007/978-3-030-20981-0_4zbMath1425.68279arXiv1901.02808OpenAlexW2953155779MaRDI QIDQ2278567

Alonso Castillo-Ramirez, Miguel Sanchez-Alvarez

Publication date: 5 December 2019

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

zbMATH Keywords

minimal number of generatorsinvertible cellular automatamonoid of cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Generating infinite monoids of cellular automata ⋮ On the minimal number of generators of endomorphism monoids of full shifts

Cites Work

• Unnamed Item
• Ranks of finite semigroups of one-dimensional cellular automata
• The minimal number of generators of a finite semigroup.
• Von Neumann regular cellular automata
• Chains of subgroups in symmetric groups
• The rank of the endomorphism monoid of a uniform partition.
• ENUMERATING FINITE GROUPS
• On Finite Monoids of Cellular Automata
• Cellular Automata and Groups
• On the ranks of certain finite semigroups of transformations
• The Automorphism Group of a Shift of Finite Type

This page was built for publication: Bounding the minimal number of generators of groups and monoids of cellular automata