On the public citation graph
On One-Way and Two-Way Cellular Automata: Bi-Productiveness, Rice-Style Theorems, and Succinctness
0 signed · 30 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/978-3-030-22996-2_3openalex-snapshot
Non-Recursive Trade-Offs Are “Almost Everywhere”
inferredcites →https://doi.org/10.1007/978-3-030-68195-1_10openalex-snapshot
On Hardest Languages for One-Dimensional Cellular Automata
inferredcites →https://doi.org/10.1007/978-3-031-71112-1_22openalex-snapshot
Decision Problems for Reversible and Permutation Automata
inferredcites →https://doi.org/10.1007/978-3-031-81097-8_4openalex-snapshot
Quantum Cellular Automata
inferredcites →https://doi.org/10.1007/978-3-319-18812-6_5openalex-snapshot
Real-Time Reversible One-Way Cellular Automata
inferredcites →https://doi.org/10.1007/978-3-319-73216-9_6openalex-snapshot
Cellular Automata: Descriptional Complexity and Decidability
inferredcites →https://doi.org/10.1007/978-3-540-78291-9_6openalex-snapshot
Cellular Automata – A Computational Point of View
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/s00224-024-10169-9openalex-snapshot
Pumping Lemmas Can be “Harmful”
inferredcites →https://doi.org/10.1007/s00236-023-00439-3openalex-snapshot
On the undecidability and descriptional complexity of synchronized regular expressions
inferredcites →https://doi.org/10.1007/s10710-021-09415-7openalex-snapshot
Evolutionary algorithms for designing reversible cellular automata
inferredcites →https://doi.org/10.1007/s11047-018-9696-8openalex-snapshot
A survey of cellular automata: types, dynamics, non-uniformity and applications
inferredcites →https://doi.org/10.1007/s11047-019-09762-6openalex-snapshot
An overview of quantum cellular automata
inferredcites →https://doi.org/10.1016/0020-0255(93)90052-nopenalex-snapshot
Cellular automata in pattern recognition
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0167-2789(90)90194-topenalex-snapshot
Computation theoretic aspects of cellular automata
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/0304-3975(94)00212-2openalex-snapshot
On real time one-way cellular array
inferredcites →https://doi.org/10.1016/j.jpcs.2023.111303openalex-snapshot
Mixed-valence realizations of quantum dot cellular automata
inferredcites →https://doi.org/10.1016/j.physd.2021.133074openalex-snapshot
Progress, gaps and obstacles in the classification of cellular automata
inferredcites →https://doi.org/10.1016/j.tcs.2024.114721openalex-snapshot
Reversibility of elementary cellular automata with fully asynchronous updating: An analysis of the rules with partial recurrence
inferredcites →https://doi.org/10.1016/j.tcs.2025.115063openalex-snapshot
On the computational and descriptional complexity of multi-pattern languages
inferredcites →https://doi.org/10.1109/swat.1970.4openalex-snapshot
Cellular automata and formal languages
inferredcites →https://doi.org/10.1142/s012905410300214xopenalex-snapshot
A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
inferredcites →https://doi.org/10.1142/s0129054121420053openalex-snapshot
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
inferredcites →https://doi.org/10.1145/321495.321507openalex-snapshot
On the Complexity of Undecidable Problems in Automata Theory
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
inferredcites →https://doi.org/10.25596/jalc-2002-549openalex-snapshot
Descriptional Complexity of Cellular Automata and Decidability Questions
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.