On the public citation graph
Exact results for deterministic cellular automata with additive rules
0 signed · 48 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.1007/bf01223745openalex-snapshot
Algebraic properties of cellular automata
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot
Statistical mechanics 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.1007/3-540-57811-0_8openalex-snapshot
Graph theory and interactive protocols for Reachability Problems on finite 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_4openalex-snapshot
Additive Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_1openalex-snapshot
Additive Cellular Automata
inferred← citeshttps://doi.org/10.1007/bf01044234openalex-snapshot
Deterministic one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1007/bf01052755openalex-snapshot
Transient and cyclic behavior of cellular automata with null boundary conditions
inferred← citeshttps://doi.org/10.1007/bf01060073openalex-snapshot
Enumeration of limit cycles in noncylindrical cellular automata
inferred← citeshttps://doi.org/10.1007/bf01218258openalex-snapshot
Linear cellular automata and recurring sequences in finite fields
inferred← citeshttps://doi.org/10.1007/bfb0023478openalex-snapshot
On ergodic linear cellular automata over Zm
inferred← citeshttps://doi.org/10.1007/bfb0029981openalex-snapshot
Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects
inferred← citeshttps://doi.org/10.1007/bfb0055096openalex-snapshot
Inversion of circulant matrices over Zm
inferred← citeshttps://doi.org/10.1007/s11047-020-09787-2openalex-snapshot
The impact of alphabet size on pattern complexity of maxmin-$$\omega$$ cellular automata
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00169-yopenalex-snapshot
The reachability problem for finite cellular automata
inferred← citeshttps://doi.org/10.1016/0096-3003(88)90100-2openalex-snapshot
Cellular automata as a paradigm for ecological modeling
inferred← citeshttps://doi.org/10.1016/0167-2789(89)90016-xopenalex-snapshot
A numerical study of one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/0167-2789(91)90128-vopenalex-snapshot
The structure of reversible one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114606openalex-snapshot
Simulation limitations of affine cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115897openalex-snapshot
Equality of cycle lengths in one- and two-dimensional σ automata
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10085-3openalex-snapshot
On the construction of state diagrams for cellular automata with additive rules
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00227-5openalex-snapshot
Linear cellular automata with boundary conditions
inferred← citeshttps://doi.org/10.1016/s0024-3795(02)00471-8openalex-snapshot
Inversion of two level circulant matrices over Zp
inferred← citeshttps://doi.org/10.1016/s0167-2789(97)00074-2openalex-snapshot
Additive cellular automata and global injectivity
inferred← citeshttps://doi.org/10.1016/s0304-3975(95)00022-4openalex-snapshot
Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos
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.1016/s1007-5704(96)90005-2openalex-snapshot
Entropies of the automata networks with additive rule
inferred← citeshttps://doi.org/10.1063/1.531132openalex-snapshot
Period lengths of cellular automata on square lattices with rule 90
inferred← citeshttps://doi.org/10.1063/1.531841openalex-snapshot
Period lengths of cellular automata cam-90 with memory
inferred← citeshttps://doi.org/10.1080/00207161003596708openalex-snapshot
The invertibility of the XOR of rotations of a binary word
inferred← citeshttps://doi.org/10.1088/0305-4470/37/45/006openalex-snapshot
Linear reversible second-order cellular automata and their first-order matrix equivalents
inferred← citeshttps://doi.org/10.1090/s0025-5718-00-01235-7openalex-snapshot
Inversion of circulant matrices over 𝐙ₘ
inferred← citeshttps://doi.org/10.1103/physreve.49.1168openalex-snapshot
Orbits in one-dimensional finite linear cellular automata
inferred← citeshttps://doi.org/10.1109/12.508317openalex-snapshot
Analysis of one-dimensional linear hybrid cellular automata over GF(q)
inferred← citeshttps://doi.org/10.1109/norcas64408.2024.10752468openalex-snapshot
Fully Automated Implementation of Reservoir Computing Models on FPGAs for Nanosecond Inference Times
inferred← citeshttps://doi.org/10.1142/s0217979204025518openalex-snapshot
STATISTICAL PROPERTIES OF THE ADDITIVE AUTOMATON NETWORKS
inferred← citeshttps://doi.org/10.1145/349194.349202openalex-snapshot
A brief history of cellular automata
inferred← citeshttps://doi.org/10.25088/complexsystems.30.3.239openalex-snapshot
Maximal Temporal Period of a Periodic Solution Generated by a One-Dimensional Cellular Automaton
inferred← citeshttps://doi.org/10.3390/info10090265openalex-snapshot
Breaking the MDS-PIR Capacity Barrier via Joint Storage Coding
inferred← citeshttps://doi.org/10.3390/math14183284openalex-snapshot
A Knights and Knaves Game on Paths
inferred← citeshttps://doi.org/10.5109/13413openalex-snapshot
EXISTENCE OF THE CHARACTERISTIC NUMBERS ASSOCIATED WITH CELLULAR AUTOMATA WITH LOCAL TRANSITION RULE 90
inferred← citeshttps://doi.org/10.5109/13414openalex-snapshot
ON A POLYNOMIAL REPRESENTATION OF FINITE LINEAR CELLULAR AUTOMATA
inferred← citeshttps://doi.org/10.5815/ijcnis.2012.03.06openalex-snapshot
Investigations of Cellular Automata Linear Rules for Edge Detection
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.