References

  1. Karel Čulík II (1989): Variations of the firing squad problem and applications. Information Processing Letters 30(3), pp. 152 – 157, doi:10.1016/0020-0190(89)90134-8.
  2. Oscar H. Ibarra & Tao Jiang (1988): Relating the Power of Cellular Arrays to Their Closure Properties. Theoretical Computer Science 57, pp. 225–238, doi:10.1016/0304-3975(88)90040-0.
  3. Jarkko Kari (2005): Theory of cellular automata: a survey. Theoretical Computer Science 334(1-3), pp. 3 – 33, doi:10.1016/j.tcs.2004.11.021.
  4. Martin Kutrib (2008): Cellular Automata - A Computational Point of View. In: New Developments in Formal Languages and Applications, pp. 183–227, doi:10.1007/978-3-540-78291-9_6.
  5. Martin Kutrib & Andreas Malcher (2010): Transductions Computed by Iterative Arrays. In: Jarkko Kari: Proceedings of JAC 2010. TUCS, pp. 156–167.
  6. Jacques Mazoyer (1996): On Optimal Solutions to the Firing Squad Synchronization Problem. Theoretical Computer Science 168(2), pp. 367 – 404, doi:10.1016/S0304-3975(96)00084-9.
  7. John von Neumann (1966): Theory of Self-Reproducing Automata. University of Illinois Press, Champaign, IL, USA.
  8. Alvy R. Smith III (1971): Cellular Automata Complexity Trade-Offs. Information and Control 18(5), pp. 466 – 482, doi:10.1016/S0019-9958(71)90501-8.
  9. Véronique Terrier (2011): Language Recognition by Cellular Automata. In: Jarkko Kari: Handbook of Natural Computing 1. Springer, pp. 123 – 158.
  10. Thomas Worsch & Hidenosuke Nishio (2010): Real-time Sorting of Binary Numbers on One-dimensional CA. In: Jarkko Kari: Proceedings of JAC 2010. TUCS, pp. 214–225.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org