On the public citation graph

Deterministic one-dimensional cellular automata

https://doi.org/10.1007/bf01044234
0 signed · 20 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/978-3-030-22456-1_1openalex-snapshot
Introduction to Linear Algebra
inferredcites →https://doi.org/10.1007/bf01020648openalex-snapshot
Exact results for deterministic cellular automata with additive rules
inferredcites →https://doi.org/10.1007/bf01223745openalex-snapshot
Algebraic properties of cellular automata
inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot
Statistical mechanics of cellular automata
inferredcites →https://doi.org/10.1109/tc.1986.1676709openalex-snapshot
Group Properties of Cellular Automata and VLSI Applications

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-1-4939-8700-9_673openalex-snapshot
Cellular Automata Hardware Implementation
inferred← citeshttps://doi.org/10.1007/978-3-031-81097-8_13openalex-snapshot
Design and Implementation of Cellular Automata Computing Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-09144-0_3openalex-snapshot
Homogeneous Dynamics for Square Boolean Automata with Null Boundary Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_673-1openalex-snapshot
Cellular Automata Hardware Implementation
inferred← citeshttps://doi.org/10.1007/bf01060073openalex-snapshot
Enumeration of limit cycles in noncylindrical cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.033openalex-snapshot
Minimum light number of lit-only σ -game on a tree
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/s0141-9331(97)00009-4openalex-snapshot
Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators
inferred← citeshttps://doi.org/10.1016/s0895-7177(02)00251-0openalex-snapshot
Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA
inferred← citeshttps://doi.org/10.1049/el:19900869openalex-snapshot
Cellular automata-based built-in self-test structures for VLSI systems
inferred← citeshttps://doi.org/10.1049/ip-e.1989.0067openalex-snapshot
Three-dimensional cellular automata and VLSI applications
inferred← citeshttps://doi.org/10.1049/ip-e.1991.0031openalex-snapshot
Pseudorandom number generators for VLSI systems based on linear cellular automata
inferred← citeshttps://doi.org/10.1109/access.2024.3428362openalex-snapshot
Exploring Cellular Automata Learning: An Innovative Approach for Secure and Imperceptible Digital Image Watermarking
inferred← citeshttps://doi.org/10.20944/preprints202311.1615.v1openalex-snapshot
A Blind Digital Image Watermarking Scheme Exploiting Elementary Cellular Automata Rule-30
inferred← citeshttps://doi.org/10.25088/complexsystems.14.2.99openalex-snapshot
Elementary Cellular Automata with Memory
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.