On the public citation graph

One guess one-way cellular arrays

https://doi.org/10.1007/bfb0055832
0 signed · 27 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/3-540-46011-xopenalex-snapshot
Developments in Language Theory
inferredcites →https://doi.org/10.1007/978-3-322-96671-1openalex-snapshot
Algorithmen in Zellularautomaten
inferredcites →https://doi.org/10.1007/bf00264617openalex-snapshot
On real-time cellular automata and trellis automata
inferredcites →https://doi.org/10.1007/s002360050123openalex-snapshot
On time computability of functions in one-way cellular automata
inferredcites →https://doi.org/10.1016/0020-0190(82)90028-xopenalex-snapshot
Deterministic one-way simulation of two-way real-time cellular automata and its related problems
inferredcites →https://doi.org/10.1016/0304-3975(84)90015-xopenalex-snapshot
Characterizations and computational complexity of systolic trellis automata
inferredcites →https://doi.org/10.1016/0743-7315(85)90034-6openalex-snapshot
Some results concerning linear iterative (systolic) arrays
inferredcites →https://doi.org/10.1016/s0019-9958(80)90164-3openalex-snapshot
One-way bounded cellular automata
inferredcites →https://doi.org/10.1016/s0022-0000(72)80004-7openalex-snapshot
Real-time language recognition by one-dimensional cellular automata
inferredcites →https://doi.org/10.1016/s0304-3975(97)00187-4openalex-snapshot
Pushdown cellular automata
inferredcites →https://doi.org/10.1051/ita/1984180403071openalex-snapshot
On real time and linear time cellular automata
inferredcites →https://doi.org/10.1080/00207168408803410openalex-snapshot
Systolic trellis automatata †
inferredcites →https://doi.org/10.1080/00207168408803421openalex-snapshot
Systolic trellis automatat†
inferredcites →https://doi.org/10.1137/0216072openalex-snapshot
On One-Way Cellular Arrays
inferredcites →https://doi.org/10.1145/321556.321558openalex-snapshot
Two-way balloon automata and AFL

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-44683-4_39openalex-snapshot
A Time Hierarchy for Bounded One-Way Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_17openalex-snapshot
Real-Time Language Recognition by Alternating Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-45132-3_16openalex-snapshot
Speeding-Up Cellular Automata by Alternations
inferred← citeshttps://doi.org/10.1007/978-3-319-18812-6_1openalex-snapshot
Complexity of One-Way Cellular Automata
inferred← citeshttps://doi.org/10.1007/s002360200092openalex-snapshot
A quadratic speedup theorem for iterative arrays
inferred← citeshttps://doi.org/10.1023/a:1024087118762openalex-snapshot
Parallel Grammars: A Phenomenology
inferred← citeshttps://doi.org/10.1080/03081079.2012.695896openalex-snapshot
Non-deterministic cellular automata and languages
inferred← citeshttps://doi.org/10.1142/9789812704979_0006openalex-snapshot
ITERATIVE ARRAYS WITH LIMITED NONDETERMINISTIC COMMUNICATION CELL
inferred← citeshttps://doi.org/10.1142/9789812792464_0026openalex-snapshot
ON TALLY LANGUAGES AND GENERALIZED INTERACTING AUTOMATA
inferred← citeshttps://doi.org/10.22029/jlupub-6993openalex-snapshot
On interacting automata with limited nondeterminism
inferred← citeshttps://doi.org/10.25596/jalc-2002-549openalex-snapshot
Descriptional Complexity of Cellular Automata and Decidability Questions
inferred← citeshttps://doi.org/10.4204/eptcs.31.4openalex-snapshot
Remembering Chandra Kintala
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.