Idempotent cellular automata and their natural order

DOI10.1016/J.TCS.2024.114698MaRDI QIDQ6589846FDOQ6589846

Maria G. Magaña-Chavez, Alonso Castillo-Ramirez, Eduardo Veliz-Quintero

Publication date: 20 August 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

cellular automataidempotentpatternnatural order on semigroups

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Theory of cellular automata: a survey
• The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
• Endomorphisms and automorphisms of the shift dynamical system
• A Natural Partial Order for Semigroups
• Title not available (Why is that?)
• The natural partial order on a regular semigroup
• Naturally ordered transformation semigroups
• Cellular Automata and Groups
• A Characterization of Cellular Automata Generated by Idempotents on the Full Shift
• An Introduction to Symbolic Dynamics and Coding
• Generating infinite monoids of cellular automata
• Exercises in Cellular Automata and Groups
• On the minimal number of generators of endomorphism monoids of full shifts
• On the minimal memory set of cellular automata

Cited In (1)

• On the minimal memory set of cellular automata

This page was built for publication: Idempotent cellular automata and their natural order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589846)