The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups

DOI10.1016/J.TCS.2004.06.006zbMath1071.68064OpenAlexW1970454946MaRDI QIDQ1884848

Fritz von Haeseler, André M. Barbé

Publication date: 27 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.06.006

zbMATH Keywords

Cellular automataPascal's triangleMatroidsCombinatorial geometryQuasigroupsLocal matching rules

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Combinatorial aspects of matroids and geometric lattices (05B35) Loops, quasigroups (20N05)

Related Items (2)

Frame cellular automata: Configurations, generating sets and related matroids ⋮ Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasilinear cellular automata
• Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2
• Linear cellular automata, finite automata and Pascal's triangle
• SYMMETRIC SELF-ORGANIZATION IN A CELLULAR AUTOMATON REQUIRING AN ESSENTIALLY RANDOM FEEDBACK: OBSERVATIONS, CONJECTURES, QUESTIONS
• COMPOSITE MATRICES
• Cellular automata, quasigroups and symmetries

This page was built for publication: The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups