On the public citation graph

Representation of Reversible Cellular Automata with Block Permutations

https://doi.org/10.1007/bf01201813

0 signed · 90 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-1-4613-8354-3_1openalex-snapshot

Symbolic Dynamics and Matrices

inferredcites →https://doi.org/10.1007/bf01691062openalex-snapshot

Endomorphisms and automorphisms of the shift dynamical system

inferredcites →https://doi.org/10.1007/bf01752388openalex-snapshot

Bicontinuous extensions of invertible combinatorial functions

inferredcites →https://doi.org/10.1007/bfb0061747openalex-snapshot

Classification of subshifts of finite type

inferredcites →https://doi.org/10.1016/0167-2789(84)90252-5openalex-snapshot

Physics-like models of computation

inferredcites →https://doi.org/10.1016/0167-2789(90)90185-ropenalex-snapshot

Invertible cellular automata: A review

inferredcites →https://doi.org/10.1016/0304-3975(90)90160-jopenalex-snapshot

Reversible parallel computation: An evolving space-model

inferredcites →https://doi.org/10.1016/s0022-0000(05)80025-xopenalex-snapshot

Reversibility and surjectivity problems of cellular automata

inferredcites →https://doi.org/10.1016/s0022-0000(72)80009-6openalex-snapshot

Tessellations with local transformations

inferredcites →https://doi.org/10.1090/s0002-9939-1988-0964880-8openalex-snapshot

Eventual Extensions of Finite Codes

inferredcites →https://doi.org/10.2307/1970903openalex-snapshot

Errata to "Classification of Subshifts of Finite Type"

inferredcites →https://doi.org/10.2307/1970908openalex-snapshot

Classification of Subshifts of Finite Type

inferredcites →https://doi.org/10.7551/mitpress/1763.001.0001openalex-snapshot

Cellular Automata Machines

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4536620openalex-extracted

The Group of Reversible Turing Machines: Subgroups, Generators and Computability

inferred← citeshttps://doi.org/10.1006/jcss.1999.1659openalex-snapshot

Structure of the Invertible CA Transformations Group

inferred← citeshttps://doi.org/10.1007/11505877_5openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/11780342_18openalex-snapshot

Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal

inferred← citeshttps://doi.org/10.1007/3-540-46541-3_9openalex-snapshot

Linear Cellular Automata with Multiple State Variables

inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_455openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-1-4471-0129-1_6openalex-snapshot

Computing Inside the Billiard Ball Model

inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_164openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_455openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-21500-2_4openalex-snapshot

Reversibility vs Local Creation/Destruction

inferred← citeshttps://doi.org/10.1007/978-3-319-22177-9_27openalex-snapshot

Block Representation of Reversible Causal Graph Dynamics

inferred← citeshttps://doi.org/10.1007/978-3-319-33924-5_3openalex-snapshot

The Ideal Energy of Classical Lattice Dynamics

inferred← citeshttps://doi.org/10.1007/978-3-319-39300-1_5openalex-snapshot

The Group of Reversible Turing Machines

inferred← citeshttps://doi.org/10.1007/978-3-319-73216-9_22openalex-snapshot

Simple Block-Substitution Rule Exhibits Interesting Patterns

inferred← citeshttps://doi.org/10.1007/978-3-319-73216-9_4openalex-snapshot

Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage

inferred← citeshttps://doi.org/10.1007/978-3-319-92675-9_6openalex-snapshot

Sequentializing Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-99498-7_3openalex-snapshot

Finite-State Classical Mechanics

inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_7openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-23477-4_6openalex-snapshot

Time in the Universe of Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_455-5openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_455-6openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_455-7openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_9openalex-snapshot

Causal Graph Dynamics

inferred← citeshttps://doi.org/10.1007/978-3-642-35482-3_17openalex-snapshot

Wolfram’s Classification and Computation in Cellular Automata Classes III and IV

inferred← citeshttps://doi.org/10.1007/978-3-642-37798-3_30openalex-snapshot

Relationship between Petri Nets and Cellular Automata for the Analysis of Flexible Manufacturing Systems

inferred← citeshttps://doi.org/10.1007/978-3-662-47221-7_13openalex-snapshot

The Ideal Energy of Classical Lattice Dynamics

inferred← citeshttps://doi.org/10.1007/978-4-431-56606-9_10openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-981-99-0688-8_15openalex-snapshot

Isomorphism in Cellular Automata

inferred← citeshttps://doi.org/10.1007/bfb0023479openalex-snapshot

Intrinsic universality of a 1-dimensional reversible Cellular Automaton

inferred← citeshttps://doi.org/10.1007/s00220-012-1423-1openalex-snapshot

Index Theory of One Dimensional Quantum Walks and Cellular Automata

inferred← citeshttps://doi.org/10.1007/s00354-018-0034-6openalex-snapshot

Reversible Cellular Automata: From Fundamental Classical Results to Recent Developments

inferred← citeshttps://doi.org/10.1007/s00607-010-0096-xopenalex-snapshot

Elementary cellular automaton Rule 110 explained as a block substitution system

inferred← citeshttps://doi.org/10.1007/s11047-012-9336-7openalex-snapshot

Conserved quantities in discrete dynamics: what can be recovered from Noether’s theorem, how, and why?

inferred← citeshttps://doi.org/10.1007/s11047-017-9644-zopenalex-snapshot

Waiting for the rapture: What can we do with computers to (hopefully) witness the emergence of life?

inferred← citeshttps://doi.org/10.1007/s11047-019-09745-7openalex-snapshot

Sequentializing cellular automata

inferred← citeshttps://doi.org/10.1007/s11047-019-09762-6openalex-snapshot

An overview of quantum cellular automata

inferred← citeshttps://doi.org/10.1007/s11047-019-09768-0openalex-snapshot

Reversible causal graph dynamics: invertibility, block representation, vertex-preservation

inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.019openalex-snapshot

Causal graph dynamics

inferred← citeshttps://doi.org/10.1016/j.ins.2016.02.046openalex-snapshot

Characterization of random fluctuation-based computation in cellular automata

inferred← citeshttps://doi.org/10.1016/j.ins.2016.12.009openalex-snapshot

Welch sets for random generation and representation of reversible one-dimensional cellular automata

inferred← citeshttps://doi.org/10.1016/j.jcss.2012.01.006openalex-snapshot

On time-symmetry in cellular automata

inferred← citeshttps://doi.org/10.1016/j.physd.2005.01.018openalex-snapshot

Procedures for calculating reversible one-dimensional cellular automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.012openalex-snapshot

How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme

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.2008.04.047openalex-snapshot

When–and how–can a cellular automaton be rewritten as a lattice gas?

inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115217openalex-snapshot

Not just the Garden of Eden: Additional takes on cellular automata surjectivity

inferred← citeshttps://doi.org/10.1017/etds.2015.67openalex-snapshot

Direct topological factorization for topological flows

inferred← citeshttps://doi.org/10.1017/fms.2025.10118openalex-snapshot

The group of reversible turing machines: subgroups, generators, and computability

inferred← citeshttps://doi.org/10.1080/10798587.2008.10642990openalex-snapshot

Modeling and Processing Using Reversible Conservative Noisy Elementary Cellular Automata Circuits and their M-Ary Quantum Computing

inferred← citeshttps://doi.org/10.1080/17445760.2019.1608990openalex-snapshot

Brief notes and history of computing in Mexico during 50 years

inferred← citeshttps://doi.org/10.1088/0305-4470/36/29/306openalex-snapshot

Reversible one-dimensional cellular automata with one of the two Welch indices equal to 1 and full shifts

inferred← citeshttps://doi.org/10.1103/physreva.95.012331openalex-snapshot

Bounds on the speedup in quantum signaling

inferred← citeshttps://doi.org/10.1103/physrevd.96.024026openalex-snapshot

Quantum causal graph dynamics

inferred← citeshttps://doi.org/10.1109/gmai.2006.21openalex-snapshot

Generating Surface Textures based on Cellular Networks

inferred← citeshttps://doi.org/10.1109/indcon.2006.302796openalex-snapshot

RPAKE: RCA-based Password Authenticated Key Exchange

inferred← citeshttps://doi.org/10.1109/isit.2014.6874994openalex-snapshot

Synchronizing rankings via interactive communication

inferred← citeshttps://doi.org/10.1142/s012905412142003xopenalex-snapshot

On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts

inferred← citeshttps://doi.org/10.1142/s0129183102003607openalex-snapshot

TRANSITIVE BEHAVIOR IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA WITH A WELCH INDEX 1

inferred← citeshttps://doi.org/10.1142/s0129183103004541openalex-snapshot

SPECTRAL PROPERTIES OF REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA

inferred← citeshttps://doi.org/10.15760/etd.129openalex-snapshot

Design of Regular Reversible Quantum Circuits

inferred← citeshttps://doi.org/10.15760/etd.7850openalex-snapshot

Classical Search and Quantum Search Algorithms for Synthesis of Quantum Circuits and Optimization of Quantum Oracles

inferred← citeshttps://doi.org/10.3233/fi-1999-381208openalex-snapshot

On the Circuit Depth of Structurally Reversible Cellular Automata

inferred← citeshttps://doi.org/10.3233/fi-2009-0041openalex-snapshot

Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

inferred← citeshttps://doi.org/10.3929/ethz-b-000044958openalex-snapshot

Index theory of one dimensional quantum walks and cellular automata

inferred← citeshttps://doi.org/10.3934/jmd.2023018openalex-snapshot

Gate lattices and the stabilized automorphism group

inferred← citeshttps://doi.org/10.4064/cm8368-9-2021openalex-snapshot

Universal groups of cellular automata

inferred← citeshttps://doi.org/10.4204/eptcs.90.5openalex-snapshot

Topology Inspired Problems for Cellular Automata, and a Counterexample in Topology

inferred← citeshttps://doi.org/10.46298/dmtcs.2297openalex-snapshot

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

inferred← citeshttps://doi.org/10.48550/arxiv.0704.3961openalex-snapshot

Intrinsically universal one-dimensional quantum cellular automata in two flavours

inferred← citeshttps://doi.org/10.48550/arxiv.1012.1334openalex-snapshot

The Block Neighborhood

inferred← citeshttps://doi.org/10.48550/arxiv.1202.1098openalex-snapshot

Causal graph dynamics

inferred← citeshttps://doi.org/10.48550/arxiv.1304.1242openalex-snapshot

Computation and Universality: Class IV versus Class III Cellular Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1603.05464openalex-snapshot

Hierarchy and Expansiveness in Two-Dimensional Subshifts of Finite Type

inferred← citeshttps://doi.org/10.48550/arxiv.1807.04437openalex-snapshot

Finite-State Classical Mechanics

inferred← citeshttps://doi.org/10.48550/arxiv.1904.12956openalex-snapshot

An overview of Quantum Cellular Automata

inferred← citeshttps://doi.org/10.5772/16155openalex-snapshot

Conservative Reversible Elementary Cellular Automata and their Quantum Computations

inferred← citeshttps://doi.org/10.6025/jisr/2018/9/2/50-62openalex-snapshot

3-Way Handshake PAKE Based on Reversible Cellular Automata

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.