Idempotent cellular automata and their natural order

DOI10.1016/J.TCS.2024.114698MaRDI QIDQ6589846zbMATH OpenFDO

Authors Alonso Castillo-Ramirez, Maria G. Magaña-Chavez, 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

• scientific article; zbMATH DE number 3689456 (Why is no real title available?)
• A Natural Partial Order for Semigroups
• A characterization of cellular automata generated by idempotents on the full shift
• An introduction to symbolic dynamics and coding
• Cellular automata and groups
• Endomorphisms and automorphisms of the shift dynamical system
• Exercises in Cellular Automata and Groups
• Generating infinite monoids of cellular automata
• Naturally ordered transformation semigroups
• On the minimal memory set of cellular automata
• On the minimal number of generators of endomorphism monoids of full shifts
• The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
• The natural partial order on a regular semigroup
• Theory of cellular automata: a survey

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)