Generating infinite monoids of cellular automata

DOI10.1142/S0219498822502152MaRDI QIDQ5039759

Alonso Castillo-Ramirez

Publication date: 4 October 2022

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

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

zbMATH Keywords

cellular automatalinear cellular automatafinitely generated monoidrank of a monoidsurjunctive group

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15) Semigroups in automata theory, linguistics, etc. (20M35) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ranks of finite semigroups of one-dimensional cellular automata
• Generation of infinite factorizable inverse monoids.
• An introduction to group rings
• A counterexample to the unit conjecture for group rings
• Bounding the minimal number of generators of groups and monoids of cellular automata
• Idempotents and one-sided units in infinite partial Brauer monoids
• Injective linear cellular automata and sofic groups
• Cellular Automata and Groups
• The Automorphism Group of a Shift of Finite Type
• A note on subgroups of automorphism groups of full shifts
• An Introduction to Symbolic Dynamics and Coding
• Transitive action on finite points of a full shift and a finitary Ryan’s theorem
• The shift and commutativity
• The Units of Group-Rings

This page was built for publication: Generating infinite monoids of cellular automata