On the public citation graph
Inducing an order on cellular automata by a grouping operation
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0167-2789(84)90245-8openalex-snapshot
Universality and complexity in cellular automata
inferredcites →https://doi.org/10.1016/0304-3975(92)00076-4openalex-snapshot
A universal cellular automaton in quasi-linear time and its S—m—n form
inferredcites →https://doi.org/10.1016/0304-3975(92)90150-eopenalex-snapshot
A linear speed-up theorem for cellular automata
inferredcites →https://doi.org/10.1137/0218057openalex-snapshot
On the Limit Sets of Cellular Automata
inferredcites →https://doi.org/10.1137/0221036openalex-snapshot
The Nilpotency Problem of One-Dimensional Cellular Automata
inferredcites →https://doi.org/10.1145/321650.321652openalex-snapshot
Simple Computation-Universal Cellular Spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_17openalex-snapshot
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_18openalex-snapshot
Damage Spreading and μ-Sensitivity on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-23111-2_10openalex-snapshot
The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-39300-1_6openalex-snapshot
Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_32openalex-snapshot
Captive Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_10openalex-snapshot
How Common Can Be Universality for Cellular Automata?
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_29openalex-snapshot
Towards a Rice Theorem on Traces of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_6openalex-snapshot
A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_1openalex-snapshot
An Introduction to Cellular Automata
inferred← citeshttps://doi.org/10.1007/bfb0055835openalex-snapshot
Additive cellular automata over ℤp and the bottom of (CA,≤)
inferred← citeshttps://doi.org/10.1007/s11047-011-9277-6openalex-snapshot
Partitioned quantum cellular automata are intrinsically universal
inferred← citeshttps://doi.org/10.1007/s11047-021-09857-zopenalex-snapshot
Communication complexity meets cellular automata: Necessary conditions for intrinsic universality
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.008openalex-snapshot
Intrinsically universal n-dimensional quantum cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.005openalex-snapshot
Communication complexity and intrinsic universality in cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.011openalex-snapshot
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00534-0openalex-snapshot
Number-conserving cellular automata I: decidability
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00134-8openalex-snapshot
Number conserving cellular automata II: dynamics
inferred← citeshttps://doi.org/10.1051/ita:2007049openalex-snapshot
Exemples de classes d'automates cellulaires
inferred← citeshttps://doi.org/10.1162/isal_a_00447openalex-snapshot
Computational Hierarchy of Elementary Cellular Automata
inferred← citeshttps://doi.org/10.3233/fi-2013-87openalex-snapshot
Stochastic Cellular Automata: Correlations, Decidability and Simulations
inferred← citeshttps://doi.org/10.3233/fi-2013-875openalex-snapshot
Stochastic Cellular Automata: Correlations, Decidability and Simulations
inferred← citeshttps://doi.org/10.3233/fi-2017-1579openalex-snapshot
The Simulation Powers and Limitations of Higher Temperature Hierarchical Self-Assembly Systems*
inferred← citeshttps://doi.org/10.4204/eptcs.90.17openalex-snapshot
Intrinsic Simulations between Stochastic Cellular Automata
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1836openalex-snapshot
On Local Symmetries and Universality in Cellular Automata
inferred← citeshttps://doi.org/10.46298/dmtcs.2973openalex-snapshot
Selfsimilarity, Simulation and Spacetime Symmetries
inferred← citeshttps://doi.org/10.48550/arxiv.0902.1253openalex-snapshot
On Local Symmetries And Universality In Cellular Autmata
inferred← citeshttps://doi.org/10.48550/arxiv.0907.3827openalex-snapshot
Intrinsically universal n-dimensional quantum cellular automata
inferred← citeshttps://doi.org/10.48550/arxiv.1010.2335openalex-snapshot
Partitioned quantum cellular automata are intrinsically universal
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0604007openalex-snapshot
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
inferred← citeshttps://doi.org/10.70675/8302c1f7zb943z444cz8b8ez9c05263e75c6openalex-snapshot
Discrétisation automatique de machines à signaux en automates cellulaires
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.