On the public citation graph
On real-time cellular automata and trellis automata
0 signed · 152 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.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/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.1109/sfcs.1991openalex-snapshot
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
inferredcites →https://doi.org/10.1109/swat.1970.4openalex-snapshot
Cellular automata and formal languages
inferredcites →https://doi.org/10.1109/t-c.1969.222663openalex-snapshot
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
inferredcites →https://doi.org/10.1109/t-c.1974.223995openalex-snapshot
On Some Open Problems in the Theory of Cellular Automata
inferredcites →https://doi.org/10.1145/321281.321290openalex-snapshot
Generation of Primes by a One-Dimensional Real-Time Iterative Array
inferredcites →https://doi.org/10.1145/800220.806704openalex-snapshot
Folding and unrolling systolic arrays (Preliminary Version)
inferredcites →https://doi.org/10.7551/mitpress/3999.001.0001openalex-snapshot
Iterative Arrays of Logical Circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/3527602968.ch4openalex-snapshot
Computation in Cellular Automata: A Selected Review
inferred← citeshttps://doi.org/10.1002/scj.4690181210openalex-snapshot
Faster recognition of languages for bounded cellular automata
inferred← citeshttps://doi.org/10.1002/scj.4690200204openalex-snapshot
A real‐time recognition of languages for bounded cellular automata
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_48openalex-snapshot
On the computing power of one-way cellular arrays
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_121openalex-snapshot
Systolic architectures, systems and computations
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-45005-x_35openalex-snapshot
Automaton Representation of Linear Conjunctive Languages
inferred← citeshttps://doi.org/10.1007/3-540-45132-3_16openalex-snapshot
Speeding-Up Cellular Automata by Alternations
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_40openalex-snapshot
Signals for Cellular Automata in Dimension 2 or Higher
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_26openalex-snapshot
On time-constructible functions in one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_20openalex-snapshot
Real-Time Language Recognition by One-Way and Two-Way Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_101openalex-snapshot
Unsolved theoretical problems in homogeneous structures
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_112openalex-snapshot
Basic research for cellular processing
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_68openalex-snapshot
Relativised cellular automata and complexity classes
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_36openalex-snapshot
Efficient unidimensional universal cellular automaton
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_46openalex-snapshot
Superposable Trellis Automata
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_35openalex-snapshot
One-way cellular automata on cayley graphs
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_20openalex-snapshot
The complexity of systolic dissemination of information in interconnection networks
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_47openalex-snapshot
On some open problems concerning the complexity of cellular arrays
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_59openalex-snapshot
Effective systolic algorithms for gossiping in cycles and two-dimensional grids
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_54openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-1-4471-0129-1_9openalex-snapshot
Signals on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_25openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_54openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-61588-8_5openalex-snapshot
Cellular String Generators
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_10openalex-snapshot
On Hardest Languages for One-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-69480-7_6openalex-snapshot
One-Dimensional Pattern Generation by Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-66159-4_3openalex-snapshot
Cellular Automata: From Black-and-White to High Gloss Color
inferred← citeshttps://doi.org/10.1007/978-3-031-78757-7_5openalex-snapshot
Real-Time Pattern Generation by One-Dimensional Cellular Automata
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/978-3-319-18812-6_5openalex-snapshot
Real-Time Reversible One-Way Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_14openalex-snapshot
Differences Between 2D Neighborhoods According to Real Time Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-92675-9_8openalex-snapshot
Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication
inferred← citeshttps://doi.org/10.1007/978-3-319-99813-8_31openalex-snapshot
Self-verifying Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-322-86772-8_7openalex-snapshot
Pipelineverarbeitung in systolischen und zellularen Automaten
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_11openalex-snapshot
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_34openalex-snapshot
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-78291-9_6openalex-snapshot
Cellular Automata – A Computational Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_4openalex-snapshot
Language Recognition by Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_5openalex-snapshot
Computations on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_7openalex-snapshot
Cellular Automata with Sparse Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-15979-4_74openalex-snapshot
Achieving Universal Computations on One-Dimensional Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-16184-1_9openalex-snapshot
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-47221-7_19openalex-snapshot
Recognition of Linear-Slender Context-Free Languages by Real Time One-Way 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/978-94-015-9153-9_3openalex-snapshot
Computations on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_5openalex-snapshot
Cellular Automata as Languages Recognizers
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_6openalex-snapshot
Computational Complexity of Cellular Automata: An Overview
inferred← citeshttps://doi.org/10.1007/978-94-015-9153-9_7openalex-snapshot
A Counting Equivalence Classes Method to Prove Negative Results
inferred← citeshttps://doi.org/10.1007/978-94-015-9634-3_12openalex-snapshot
Automata Arrays and Context-Free Languages
inferred← citeshttps://doi.org/10.1007/bf02127801openalex-snapshot
Computations on one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1007/bfb0015929openalex-snapshot
A survey of two-dimensional automata theory
inferred← citeshttps://doi.org/10.1007/bfb0016239openalex-snapshot
Systolic arrays: Characterizations and complexity
inferred← citeshttps://doi.org/10.1007/bfb0030288openalex-snapshot
Systolic automata — power, characterizations, nonhomogeneity
inferred← citeshttps://doi.org/10.1007/bfb0030614openalex-snapshot
Synchronization of a line of identical processors at a given time
inferred← citeshttps://doi.org/10.1007/s00224-006-1315-xopenalex-snapshot
Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods
inferred← citeshttps://doi.org/10.1007/s00236-007-0068-6openalex-snapshot
The Boolean closure of linear context-free languages
inferred← citeshttps://doi.org/10.1007/s002360050123openalex-snapshot
On time computability of functions in one-way cellular automata
inferred← citeshttps://doi.org/10.1007/s002360200092openalex-snapshot
A quadratic speedup theorem for iterative arrays
inferred← citeshttps://doi.org/10.1007/s11047-012-9312-2openalex-snapshot
Grids and universal computations on one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1007/s11047-019-09773-3openalex-snapshot
Hierarchies and undecidability results for iterative arrays with sparse communication
inferred← citeshttps://doi.org/10.1007/s11047-022-09887-1openalex-snapshot
One-dimensional pattern generation by cellular automata
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90134-8openalex-snapshot
Variations of the firing squad problem and applications
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90230-5openalex-snapshot
Optimal simulation of tree arrays by linear arrays
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90008-iopenalex-snapshot
A survey of two-dimensional automata theory
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90011-1openalex-snapshot
On iterative and cellular tree arrays
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90025-9openalex-snapshot
A property of real-time trellis automata
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90091-xopenalex-snapshot
Topological transformations as a tool in the design of systolic networks
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90130-1openalex-snapshot
Real-time, pseudo real-time, and linear-time ITA
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90040-0openalex-snapshot
Relating the power of cellular arrays to their closure properties
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90190-sopenalex-snapshot
Synthesis, structure and power of systolic computations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)00076-4openalex-snapshot
A universal cellular automaton in quasi-linear time and its S—m—n form
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90150-eopenalex-snapshot
A linear speed-up theorem for cellular automata
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00212-2openalex-snapshot
On real time one-way cellular array
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90236-4openalex-snapshot
One-way cellular automata on Cayley graphs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00111-5openalex-snapshot
Language not recognizable in real time by one-way cellular automata
inferred← citeshttps://doi.org/10.1016/0304-3975(95)80009-3openalex-snapshot
Nondeterministic, probabilistic and alternating computations on cellular array models
inferred← citeshttps://doi.org/10.1016/0734-189x(85)90096-9openalex-snapshot
Picture processing: 1984
inferred← citeshttps://doi.org/10.1016/0743-7315(85)90034-6openalex-snapshot
Some results concerning linear iterative (systolic) arrays
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104891openalex-snapshot
On hardest languages for one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.023openalex-snapshot
Languages not recognizable in real time by one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.002openalex-snapshot
On the number of nonterminals in linear conjunctive grammars
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.11.021openalex-snapshot
Theory of cellular automata: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.039openalex-snapshot
Closure properties of cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.061openalex-snapshot
Low complexity classes of multidimensional cellular automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.024openalex-snapshot
Cellular automata with sparse communication
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.023openalex-snapshot
Bulking I: An abstract theory of bulking
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.05.041openalex-snapshot
Recognition of poly-slender context-free languages by trellis automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114355openalex-snapshot
Inductive definitions in logic versus programs of real-time cellular automata
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80011-0openalex-snapshot
Systolic trellis automata: Stability, decidability and complexity
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00511-2openalex-snapshot
The hardest linear conjunctive language
inferred← citeshttps://doi.org/10.1016/s0167-739x(02)00070-5openalex-snapshot
Massively parallel fault tolerant computations on syntactical patterns
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00078-1openalex-snapshot
Efficient constant speed-up for one dimensional cellular automata calculators
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00112-8openalex-snapshot
Constructible functions in cellular automata and their applications to hierarchy results
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00406-1openalex-snapshot
Fast one-way cellular automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00575-3openalex-snapshot
Two-dimensional cellular automata and deterministic on-line tessalation automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00083-5openalex-snapshot
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00211-3openalex-snapshot
Linear speed-up for cellular automata synchronizers and applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00187-4openalex-snapshot
Pushdown cellular automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00150-9openalex-snapshot
Signals in one-dimensional cellular automata
inferred← citeshttps://doi.org/10.1023/a:1024087118762openalex-snapshot
Parallel Grammars: A Phenomenology
inferred← citeshttps://doi.org/10.1051/ita/1984180403071openalex-snapshot
On real time and linear time cellular automata
inferred← citeshttps://doi.org/10.1051/ita/1993270200971openalex-snapshot
Real time recognition with cellular automata : a meaningful example
inferred← citeshttps://doi.org/10.1051/ita/1993270504031openalex-snapshot
Language classes defined by time-bounded relativised cellular automata
inferred← citeshttps://doi.org/10.1051/ita/1994283-403031openalex-snapshot
The complexity of systolic dissemination of information in interconnection networks
inferred← citeshttps://doi.org/10.1051/ita:2004004openalex-snapshot
On the equivalence of linear conjunctive grammars and trellis automata
inferred← citeshttps://doi.org/10.1051/ita:2006002openalex-snapshot
Different time solutions for the firing squad synchronization problem on basic grid networks
inferred← citeshttps://doi.org/10.1080/00207168408803421openalex-snapshot
Systolic trellis automatat†
inferred← citeshttps://doi.org/10.1080/00207168608803543openalex-snapshot
Iterative tree arrays with logarithmic depth†
inferred← citeshttps://doi.org/10.1080/00207168708803579openalex-snapshot
Fault-tolerant schemes for some systolic systems
inferred← citeshttps://doi.org/10.1080/00207169208804070openalex-snapshot
Some results on time-varying and relativised cellular automata*
inferred← citeshttps://doi.org/10.1080/00207169908804822openalex-snapshot
On time reduction and simulation in cellular spaces
inferred← citeshttps://doi.org/10.1080/03081079.2012.695896openalex-snapshot
Non-deterministic cellular automata and languages
inferred← citeshttps://doi.org/10.1093/ietisy/e88-d.1.65openalex-snapshot
Real-Time Recognition of Cyclic Strings by One-Way and Two-Way Cellular Automata
inferred← citeshttps://doi.org/10.1109/lics.2019.8785666openalex-snapshot
Descriptive complexity for minimal time of cellular automata
inferred← citeshttps://doi.org/10.1137/0214033openalex-snapshot
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
inferred← citeshttps://doi.org/10.1142/9789812562494_0064openalex-snapshot
AN OVERVIEW OF CONJUNCTIVE GRAMMARS
inferred← citeshttps://doi.org/10.1142/9789812792464_0026openalex-snapshot
ON TALLY LANGUAGES AND GENERALIZED INTERACTING AUTOMATA
inferred← citeshttps://doi.org/10.1142/9789814447133_0008openalex-snapshot
Lower Bounds on Systolic Array Computations and the Optimality of Kung's Convolution Algorithm
inferred← citeshttps://doi.org/10.1142/s0129054103002205openalex-snapshot
EFFICIENT AUTOMATON-BASED RECOGNITION FOR LINEAR CONJUNCTIVE LANGUAGES
inferred← citeshttps://doi.org/10.1145/349194.349202openalex-snapshot
A brief history of cellular automata
inferred← citeshttps://doi.org/10.1145/44483.44493openalex-snapshot
On the power of one-way communication
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.25596/jalc-2008-299openalex-snapshot
Homomorphisms Preserving Linear Conjunctive Languages
inferred← citeshttps://doi.org/10.3233/fi-1998-341204openalex-snapshot
Synchronization of a Line of Identical Processors at a Given Time
inferred← citeshttps://doi.org/10.3233/fi-2013-878openalex-snapshot
One-Dimensional Cellular Automaton Transducers
inferred← citeshttps://doi.org/10.4204/eptcs.3.15openalex-snapshot
Bounded Languages Meet Cellular Automata with Sparse Communication
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0511044openalex-snapshot
Various Solutions to the Firing Squad Synchronization Problems
inferred← citeshttps://doi.org/10.70675/dc74b440z28f1z47a6z9ab2z64465dc05678openalex-snapshot
Caractérisation et programmation en théorie des langages et en logique des classes de complexité efficace des automates cellulaires
inferred← citeshttps://doi.org/10.7148/2011-0299-0303openalex-snapshot
Game-Logic Simulation Based On Cellular Automata And Flocking Techniques
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.