On the public citation graph

On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures

https://doi.org/10.1007/11821069_17
0 signed · 21 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0028554openalex-snapshot
Inducing an order on cellular automata by a grouping operation
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(94)90041-8openalex-snapshot
Rice's theorem for the limit sets of cellular automata
inferredcites →https://doi.org/10.1016/s0304-3975(02)00661-8openalex-snapshot
Cellular automata and intermediate degrees
inferredcites →https://doi.org/10.1017/s014338579706985xopenalex-snapshot
Languages, equicontinuity and attractors in cellular automata
inferredcites →https://doi.org/10.1023/a:1018706923831openalex-snapshot
Limit Sets of Cellular Automata Associated to Probability Measures
inferredcites →https://doi.org/10.1051/jp1:1992277openalex-snapshot
A cellular automaton model for freeway traffic
inferredcites →https://doi.org/10.1051/jp2:1992262openalex-snapshot
Neutron reflectivity study of end-adsorbed diblock copolymers : cross-over from nushrooms to brushes
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

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_6openalex-snapshot
Rice’s Theorem for μ-Limit Sets of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_22openalex-snapshot
Self-organization in Cellular Automata: A Particle-Based Approach
inferred← citeshttps://doi.org/10.1007/s00224-017-9753-1openalex-snapshot
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.10.001openalex-snapshot
A uniquely ergodic cellular automaton
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.05.004openalex-snapshot
μ-Limit sets of cellular automata from a computational complexity perspective
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.052openalex-snapshot
Directional dynamics for cellular automata: A sensitivity to initial condition approach
inferred← citeshttps://doi.org/10.1017/etds.2016.46openalex-snapshot
Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
inferred← citeshttps://doi.org/10.1051/proc/201760203openalex-snapshot
Probability and algorithmics: a focus on some recent developments
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1998openalex-snapshot
Characterisation of sets of limit measures after iteration of a cellular automaton on an initial measure
inferred← citeshttps://doi.org/10.48550/arxiv.2108.12925openalex-snapshot
Generically Nilpotent Cellular Automata
inferred← citeshttps://doi.org/10.70675/94f26632z88a9z4fbbzb592z9bd82dbe8eacopenalex-snapshot
Asymptotic behaviour of cellular automata : computation and randomness
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.