1. Henning Bordihn, Martin Kutrib & Andreas Malcher (2011): Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22, pp. 1577–1592, doi:10.1142/S0129054111008891.
  2. Henning Bordihn, Martin Kutrib & Andreas Malcher (2012): On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23, pp. 713–732, doi:10.1142/S0129054112500062.
  3. Thomas Buchholz & Martin Kutrib (1998): On time computability of functions in one-way cellular automata. Acta Inform. 35, pp. 329–352, doi:10.1007/s002360050123.
  4. Ashish Choudhary, Kamala Krithivasan & Victor Mitrana (2007): Returning and non-returning parallel communicating finite automata are equivalent. RAIRO Inform. Théor. 41, pp. 137–145, doi:10.1051/ita:2007014.
  5. John E. Hopcroft & Jeffrey D. Ullman (1979): Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
  6. Oscar H. Ibarra (1973): On Two-way Multihead Automata. J. Comput. System Sci. 7, pp. 28–36, doi:10.1016/S0022-0000(73)80048-0.
  7. 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.
  8. 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.
  9. Martin Kutrib & Andreas Malcher (2011): Two-Party Watson-Crick Computations. In: Implementation and Application of Automata (CIAA 2010), LNCS 6482. Springer, pp. 191–200, doi:10.1007/978-3-642-18098-9_21.
  10. Ming Li & Paul M. B. Vitányi (1993): An Introduction to Kolmogorov Complexity and Its Applications. Springer, doi:10.1007/978-1-4757-3860-5.
  11. Andreas Malcher (2002): Descriptional Complexity of Cellular Automata and Decidability Questions. J. Autom., Lang. Comb. 7, pp. 549–560.
  12. Carlos Martín-Vide, Alexandru Mateescu & Victor Mitrana (2002): Parallel Finite Automata Systems Communicating by States. Int. J. Found. Comput. Sci. 13, pp. 733–749, doi:10.1142/S0129054102001424.
  13. Victor Mitrana (2000): On the Degree of Communication in Parallel Communicating Finite Automata Systems. J. Autom., Lang. Comb. 5, pp. 301–314.
  14. Friedrich Otto (2013): Asynchronous PC systems of pushdown automata. In: Language and Automata Theory and Applications (LATA 2013), LNCS 7810. Springer, pp. 456–467, doi:10.1007/978-3-642-37064-9_40.
  15. Marcel Vollweiler (2013): Asynchronous systems of parallel communicating finite automata. In: Fifth Workshop on Non-Classical Models for Automata and Applications (NCMA 2013), 294. Austrian Computer Society, Vienna, pp. 243–257.

Comments and questions to:
For website issues: