On the public citation graph

On ergodic linear cellular automata over Zm

https://doi.org/10.1007/bfb0023478
0 signed · 32 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/bf01020648openalex-snapshot
Exact results for deterministic cellular automata with additive rules
inferredcites →https://doi.org/10.1007/bf01466724openalex-snapshot
Ergodic endomorphisms of compact abelian groups
inferredcites →https://doi.org/10.1007/bf01691062openalex-snapshot
Endomorphisms and automorphisms of the shift dynamical system
inferredcites →https://doi.org/10.1007/bf01704016openalex-snapshot
On the ergodic theory of cellular automata
inferredcites →https://doi.org/10.1007/bf02099076openalex-snapshot
On ergodic one-dimensional cellular automata
inferredcites →https://doi.org/10.1016/0022-0000(83)90033-8openalex-snapshot
Linear cellular automata over Z
inferredcites →https://doi.org/10.1016/0022-0000(85)90048-0openalex-snapshot
Dynamical characteristics of linear 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/s0022-0000(72)80013-8openalex-snapshot
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
inferredcites →https://doi.org/10.1016/s0304-3975(95)00022-4openalex-snapshot
Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
inferredcites →https://doi.org/10.1017/s0143385700005848openalex-snapshot
Ergodic aspects of cellular automata
inferredcites →https://doi.org/10.1063/1.2820117openalex-snapshot
An Introduction to Chaotic Dynamical Systems
inferredcites →https://doi.org/10.1080/00029890.1994.11996955openalex-snapshot
On Intervals, Transitivity = Chaos
inferredcites →https://doi.org/10.1080/00029890.1996.12004699openalex-snapshot
Transitive Cellular Automata Are Sensitive
inferredcites →https://doi.org/10.1137/0218057openalex-snapshot
On the Limit Sets of 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.1006/jcss.1997.1535openalex-snapshot
Invertible Linear Cellular Automata overZm:
inferred← citeshttps://doi.org/10.1006/jcss.1998.1609openalex-snapshot
Attractors of Linear Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_19openalex-snapshot
On Some Topological Properties of Linear Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_232openalex-snapshot
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_178openalex-snapshot
Ergodic Theory of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4471-0941-9_5openalex-snapshot
Essential Transformations of the One Dimensional Cellular Automata Rule Space and Endomorphisms of Compact Abelian Groups
inferred← citeshttps://doi.org/10.1007/978-94-015-9223-9_3openalex-snapshot
Time Averages for Some Classes of Expansive One-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/bfb0028555openalex-snapshot
Attractors of D-dimensional Linear Cellular Automata
inferred← citeshttps://doi.org/10.1007/bfb0029961openalex-snapshot
A shift-invariant metric on S zz inducing a non-trivial topology
inferred← citeshttps://doi.org/10.1007/bfb0029981openalex-snapshot
Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects
inferred← citeshttps://doi.org/10.1007/s40747-023-01330-xopenalex-snapshot
ReLiCADA: Reservoir Computing Using Linear Cellular Automata design algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.008openalex-snapshot
Solution of some conjectures about topological properties of linear cellular automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00005-xopenalex-snapshot
Ergodicity, transitivity, and regularity for linear cellular automata over Zm
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00031-6openalex-snapshot
A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Zm
inferred← citeshttps://doi.org/10.1080/03081079.2012.695898openalex-snapshot
The ergodic theory of cellular automata
inferred← citeshttps://doi.org/10.3390/e2030142openalex-snapshot
Additive Cellular Automata and Volume Growth
inferred← citeshttps://doi.org/10.48550/arxiv.1205.3960openalex-snapshot
A family of sand automata
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.