Cellular automata, quasigroups and symmetries

DOI10.1007/PL00000149zbMath0988.68115OpenAlexW1995018692MaRDI QIDQ5953386

Fritz von Haeseler, André M. Barbé

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) Enumeration in graph theory (05C30) Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80)

Related Items (5)

The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups ⋮ SYMMETRIC SELF-ORGANIZATION IN A CELLULAR AUTOMATON REQUIRING AN ESSENTIALLY RANDOM FEEDBACK: OBSERVATIONS, CONJECTURES, QUESTIONS ⋮ Frame cellular automata: Configurations, generating sets and related matroids ⋮ Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs ⋮ Constructing Pandiagonal Latin Squares from Linear Cellular Automaton on Elementary Abelian Groups

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