On the public citation graph

Linear cellular automata and recurring sequences in finite fields

https://doi.org/10.1007/bf01218258
0 signed · 49 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.1002/9780470050118.ecse011openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1007/978-1-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1007/bf01020648openalex-snapshot
Exact results for deterministic cellular automata with additive rules
inferredcites →https://doi.org/10.1007/bf01221109openalex-snapshot
Cylindrical cellular automata
inferredcites →https://doi.org/10.1007/bf01223745openalex-snapshot
Algebraic properties of cellular automata
inferredcites →https://doi.org/10.1016/0021-8693(73)90170-1openalex-snapshot
Products of linear recurring sequences
inferredcites →https://doi.org/10.1137/0107003openalex-snapshot
Linear Recurring Sequences
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-55808-x_46openalex-snapshot
Superposable Trellis Automata
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-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/978-1-4614-1800-9_62openalex-snapshot
Ergodic Theory of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_178openalex-snapshot
Ergodic Theory of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-53043-7_5openalex-snapshot
Attractors
inferred← citeshttps://doi.org/10.1007/978-3-642-77905-3_3openalex-snapshot
Linear Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-77905-3_9openalex-snapshot
Asymptotic Behavior
inferred← citeshttps://doi.org/10.1007/978-94-011-1691-6_24openalex-snapshot
Transience and Dislocations in One-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_1openalex-snapshot
An Introduction to Cellular Automata
inferred← citeshttps://doi.org/10.1007/bf01221109openalex-snapshot
Cylindrical cellular automata
inferred← citeshttps://doi.org/10.1007/bf02179466openalex-snapshot
A note on inherent replication properties of local cellular automata transition functions
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/0167-2789(90)90169-popenalex-snapshot
Aperiodicity in one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/0167-2789(92)90086-3openalex-snapshot
Limit cycles in a quadratic discrete iteration
inferred← citeshttps://doi.org/10.1016/0167-2789(94)90079-5openalex-snapshot
Cellular automata and finite fields
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.01.009openalex-snapshot
A 4-states algebraic solution to linear cellular automata synchronization
inferred← citeshttps://doi.org/10.1016/j.laa.2005.09.002openalex-snapshot
Iterations of linear maps over finite fields
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114606openalex-snapshot
Simulation limitations of affine cellular automata
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00227-5openalex-snapshot
Linear cellular automata with boundary conditions
inferred← citeshttps://doi.org/10.1016/s0167-2789(97)00074-2openalex-snapshot
Additive cellular automata and global injectivity
inferred← citeshttps://doi.org/10.1061/9780784413029.091openalex-snapshot
Linear Cellular Automation Method for Predicting Dynamic Instability Mode of Single-Layer Shell
inferred← citeshttps://doi.org/10.1070/rm1991v046n01abeh002725openalex-snapshot
On some problems in the theory of finite fields
inferred← citeshttps://doi.org/10.1080/03081079.2012.695898openalex-snapshot
The ergodic theory of cellular automata
inferred← citeshttps://doi.org/10.1080/10236190802566509openalex-snapshot
Ducci sequences and cyclotomic fields
inferred← citeshttps://doi.org/10.1080/10586458.2007.10129005openalex-snapshot
Jointly Periodic Points in Cellular Automata: Computer Explorations and Conjectures
inferred← citeshttps://doi.org/10.1088/0305-4470/24/1/007openalex-snapshot
Topological classification of cellular automata
inferred← citeshttps://doi.org/10.1088/0951-7715/4/2/004openalex-snapshot
Exact solvability and quasiperiodicity of one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1088/0951-7715/5/1/005openalex-snapshot
Geometry of linear maps over finite fields
inferred← citeshttps://doi.org/10.1103/physrevlett.68.3830openalex-snapshot
Second-order dynamics in the collective temporal evolution of complex systems
inferred← citeshttps://doi.org/10.1103/physrevlett.90.034102openalex-snapshot
Arithmetical Method to Detect Integrability in Maps
inferred← citeshttps://doi.org/10.1145/349194.349202openalex-snapshot
A brief history of cellular automata
inferred← citeshttps://doi.org/10.1162/isal_a_00447openalex-snapshot
Computational Hierarchy of Elementary Cellular Automata
inferred← citeshttps://doi.org/10.1162/isal_a_00478openalex-snapshot
The 2021 Conference on Artificial Life (full proceedings pdf)
inferred← citeshttps://doi.org/10.1214/22-ejp744openalex-snapshot
One-dimensional cellular automata with random rules: longest temporal period of a periodic solution
inferred← citeshttps://doi.org/10.1216/rmjm/1181069447openalex-snapshot
Characteristic and Minimal Polynomials of Linear Cellular Automata
inferred← citeshttps://doi.org/10.25088/complexsystems.15.1.41openalex-snapshot
Point Mutations and Transitions Between Cellular Automata Attractor Basins
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.37236/10114openalex-snapshot
Periodic Solutions of One-Dimensional Cellular Automata with Uniformly Chosen Random Rules
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06913openalex-snapshot
Periodic solutions of one-dimensional cellular automata with random rules
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.