Cellular automata, quasigroups and symmetries
From MaRDI portal
Publication:5953386
DOI10.1007/PL00000149zbMATH Open0988.68115OpenAlexW1995018692MaRDI QIDQ5953386FDOQ5953386
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
Recommendations
Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Enumeration in graph theory (05C30) Cellular automata (computational aspects) (68Q80)
Cited In (10)
- Universal groups of cellular automata
- Cellular Automata with Symmetric Local Rules
- SYMMETRIC SELF-ORGANIZATION IN A CELLULAR AUTOMATON REQUIRING AN ESSENTIALLY RANDOM FEEDBACK: OBSERVATIONS, CONJECTURES, QUESTIONS
- Constructing pandiagonal Latin squares from linear cellular automaton on elementary abelian groups
- Frame cellular automata: Configurations, generating sets and related matroids
- Internal symmetries of cellular automata via their polynomial representation
- Groups and Monoids of Cellular Automata
- 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
- Highly symmetric cellular automata and their symmetry-breaking patterns
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)