References

1. Mikołaj Bojańczyk, Bartek Klin & Slawomir Lasota (2011): Automata with Group Actions. In: LICS. IEEE Computer Society, pp. 355–364, doi:10.1109/LICS.2011.48.
2. Mikołaj Bojańczyk, Bartek Klin, Slawomir Lasota & Szymon Toruńczyk (2013): Turing Machines with Atoms. In: LICS. IEEE Computer Society, pp. 183–192, doi:10.1109/LICS.2013.24.
3. Matthew Cook (2004): Universality in Elementary Cellular Automata. Complex Systems 15(1), pp. 1–40.
4. Murdoch Gabbay & Andrew M. Pitts (1999): A New Approach to Abstract Syntax Involving Binders. In: LICS. IEEE Computer Society, pp. 214–224, doi:10.1109/LICS.1999.782617.
5. Murdoch James Gabbay & Vincenzo Ciancia (2011): Freshness and Name-Restriction in Sets of Traces with Names. In: FOSSACS, LNCS 6604. Springer, pp. 365–380, doi:10.1007/978-3-642-19805-2_25.
6. Andrew Ilachinski (2001): Cellular Automata - A Discrete Universe. World Scientific, doi:10.1142/4702.
7. Dexter Kozen, Konstantinos Mamouras, Daniela Petrisan & Alexandra Silva (2015): Nominal Kleene Coalgebra. In: ICALP, LNCS 9135. Springer, pp. 286–298, doi:10.1007/978-3-662-47666-6_23.
8. Ugo Montanari & Marco Pistore (2000): pi-Calculus, Structured Coalgebras, and Minimal HD-Automata. In: MFCS, LNCS 1893, pp. 569–578, doi:10.1007/3-540-44612-5_52.
9. Stephen Wolfram (1984): Cellular Automata as Models of Complexity. Nature 311(4), pp. 419–424, doi:10.1038/311419a0.
10. Stephen Wolfram (2002): A New Kind of Science. Wolfram Media, Inc..
11. K. Zuse (1970): Calculating space. Technical Report. Proj, MAC, MIT, Cambridge, Mass.. Technical Translation AZT-70-164-GEMIT. Original title: "Rechnender Raum"..

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org