M.A. Arbib (1988):
The universal Turing machine, chapter From universal Turing machines to self-reproduction,
pp. 177–189.
Oxford Science Publications.
P. Arrighi & G. Dowek (2012):
Causal graph dynamics.
In: Proceedings of ICALP 2012, Warwick, July 2012, LNCS 7392,
pp. 54–66,
doi:10.1007/978-3-642-31585-5_9.
P. Arrighi, R. Fargetton & Z. Wang (2009):
Intrinsically universal one-dimensional quantum cellular automata in two flavours.
Fundamenta Informaticae 21,
pp. 1001–1035,
doi:10.3233/FI-2009-0041.
P. Arrighi & J. Grattage (2012):
Partitioned Quantum Cellular Automata are Intrinsically Universal.
Natural Computing 11,
pp. 13–22,
doi:10.1007/s11047-011-9277-6.
P. Arrighi & S. Martiel (2012):
Generalized Cayley graphs and cellular automata over them.
In: Proceedings of GCM 2012, Bremen, September 2012. Pre-print arXiv:1212.0027,
pp. 129–143.
J.L. Balcázar, J. Díaz & J. Gabarró (1988):
Structural Complexity I.
Springer Verlag,
doi:10.1007/978-3-642-97062-7.
J. O. Durand-Lose (1997):
Intrinsic universality of a 1-dimensional reversible cellular automaton.
In: Proceedings of STACS 97, Lecture Notes in Computer Science 1200.
Springer,
pp. 439–450,
doi:10.1007/BFb0023479.
B. Martin (1997):
Cellular automata universality revisited.
In: FCT'97,
LNCS 1279.
Springer Verlag,
pp. 329–339,
doi:10.1007/BFb0036195.
N. Ollinger (2008):
Intrinsically Universal Cellular Automata..
In: Turlough Neary, Damien Woods, Anthony Karel Seda & Niall Murphy: CSP.
Cork University Press,
pp. 259–266,
doi:10.4204/EPTCS.1.19.
Guillaume Theyssier (2005):
How common can be universality for cellular automata?.
In: STACS 2005.
Springer,
pp. 121–132,
doi:10.1007/978-3-540-31856-9_10.
eptcs@eptcs.org