On the circuit depth of structurally reversible cellular automata

Theory of cellular automata: a survey

Theoretical Computer Science

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

Theoretical Computer Science

Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

Fundamenta Informaticae - Machines, Computations and Universality, Part II

Applying causality principles to the axiomatization of probabilistic cellular automata

CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe

Reversible cellular automata

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

Partitioned quantum cellular automata are intrinsically universal

Natural Computing: an international journal