References

  1. Alfred V. Aho & Jeffrey D. Ullman (1972): The Theory of Parsing, Translation, and Compiling I: Parsing. Prentice-Hall.
  2. Jean Berstel (1979): Transductions and Context-Free-Languages. Teubner.
  3. Oscar H. Ibarra, Tao Jiang & Hui Wang (1991): Parallel Parsing on a One-Way Linear Array of Finite-State Machines. Theoret. Comput. Sci. 85, pp. 53–74, doi:10.1007/3-540-52048-1_51.
  4. Martin Kutrib (2008): Cellular Automata – A Computational Point of View. In: New Developments in Formal Languages and Applications, chapter 6. Springer, pp. 183–227, doi:10.1007/978-3-540-78291-9_6.
  5. Martin Kutrib (2009): Cellular Automata and Language Theory. In: Encyclopedia of Complexity and System Science. Springer, pp. 800–823, doi:10.1007/978-0-387-30440-3_54.
  6. Martin Kutrib & Andreas Malcher (2010): Transductions Computed by Iterative Arrays. In: Symposium on Cellular Automata – Journées Automates Cellulaires (JAC 2010), TUCS Lecture Notes 13. Turku Center for Computer Science, pp. 156–167.
  7. Alvy Ray Smith III (1970): Cellular Automata and Formal Languages. In: Symposium on Switching and Automata Theory (SWAT 1970). IEEE, pp. 216–224, doi:10.1109/SWAT.1970.4.
  8. Alvy Ray Smith III (1972): Real-Time Language Recognition by One-Dimensional Cellular Automata. J. Comput. System Sci. 6, pp. 233–253, doi:10.1016/S0022-0000(72)80004-7.
  9. Andreas Weber & Reinhard Klemm (1995): Economy of Description for Single-Valued Transducers. Inform. Comput. 118, pp. 327–340, doi:10.1006/inco.1995.1071.

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