Frame cellular automata: Configurations, generating sets and related matroids

DOI10.1016/J.DISC.2008.01.046zbMATH Open1229.05059OpenAlexW1969271696MaRDI QIDQ1024429FDOQ1024429

Fritz von Haeseler, André Barbé

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.046

Recommendations

• The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups
• Cellular automata on a \(G\)-set
• Cellular automata, matrix substitutions and fractals
• Cellular automata over algebraic structures
• Factorization of combinatorial \(R\) matrices and associated cellular automata.
• scientific article; zbMATH DE number 6149843
• The algebraic properties of finite cellular automata
• Publication:4731837
• On the conjugacy problem of cellular automata

zbMATH Keywords

submodularitycombinatorial geometrymatroidsindependent sets\(n\)-ary quasigroupscovers of finite setsgeneralized cellular automatonmultary quasigroupsquasigroup defined cellular automaton

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
• Symmetric patterns in the cellular automaton that generates Pascal's triangle modulo 2
• Covers of a Finite Set
• Minimal covers of finite sets
• The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups
• Title not available (Why is that?)
• SYMMETRIC SELF-ORGANIZATION IN A CELLULAR AUTOMATON REQUIRING AN ESSENTIALLY RANDOM FEEDBACK: OBSERVATIONS, CONJECTURES, QUESTIONS
• Cellular automata, quasigroups and symmetries

Cited In (2)

• 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: Frame cellular automata: Configurations, generating sets and related matroids

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