Cellular automata, quasigroups and symmetries

DOI10.1007/PL00000149MaRDI QIDQ5953386zbMATH OpenOpenAlexFDO

Authors André Barbé, Fritz von Haeseler

Publication date 22 July 2002

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00000149

zbMATH Keywords

cellular automata

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Enumeration in graph theory (05C30) Cellular automata (computational aspects) (68Q80)

Recommendations

• Symmetric cellular automata
• Highly symmetric cellular automata and their symmetry-breaking patterns
• Cellular Automata with Symmetric Local Rules
• The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups
• Internal symmetries of cellular automata

Cited in

(11)

• Groups and Monoids of Cellular Automata
• Shift-symmetric configurations in two-dimensional cellular automata: irreversibility, insolvability, and enumeration
• Universal groups of cellular automata
• Frame cellular automata: Configurations, generating sets and related matroids
• Cellular Automata with Symmetric Local Rules
• SYMMETRIC SELF-ORGANIZATION IN A CELLULAR AUTOMATON REQUIRING AN ESSENTIALLY RANDOM FEEDBACK: OBSERVATIONS, CONJECTURES, QUESTIONS
• Internal symmetries of cellular automata via their polynomial representation
• Highly symmetric cellular automata and their symmetry-breaking patterns
• Constructing pandiagonal Latin squares from linear cellular automaton on elementary abelian groups
• Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs
• The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups

This page was built for publication: Cellular automata, quasigroups and symmetries

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