1. Cook, M.: Universality in elementary cellular automata. Complex Systems 15(1), 1–40 (2004)
2. Herrmann, F., Margenstern, M.: A universal cellular automaton in the hyperbolic plane. Theoretical Computer Science 296, 327–364 (2003)
3. Margenstern, M.: Frontier between decidability and undecidability a survey. Theoretical Computer Science 231(2), 217–251 (2000)
4. Margenstern, M.: New Tools for Cellular Automata of the Hyperbolic Plane. Journal of Universal Computer Science 6(12), 1226–1252 (2000)
5. Margenstern, M.: Two railway circuits: a universal circuit and an NP-difficult one. Computer Science Journal of Moldova 9, 1–35 (2001)