On the minimal number of generators of endomorphism monoids of full shifts

DOI10.1007/s11047-020-09785-4arXiv1910.01081OpenAlexW2977799525MaRDI QIDQ6155014

Alonso Castillo-Ramirez

Publication date: 16 February 2024

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

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

zbMATH Keywords

endomorphismscellular automataautomorphismsminimal number of generatorsfull shift

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Ranks of finite semigroups of one-dimensional cellular automata
• The minimal number of generators of a finite semigroup.
• Locally graded groups with certain minimal conditions for subgroups. II
• Von Neumann regular cellular automata
• Chains of subgroups in symmetric groups
• Subgroup growth.
• Bounding the minimal number of generators of groups and monoids of cellular automata
• The rank of the endomorphism monoid of a uniform partition.
• ENUMERATING FINITE GROUPS
• Fundamentals of Group Theory
• 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
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: On the minimal number of generators of endomorphism monoids of full shifts