<bibliography>
 <citation type="article" key="bordihn:2011:uhrpcfa">
  <author>Henning <surname>Bordihn</surname></author>
  <author>Martin <surname>Kutrib</surname></author>
  <author>Andreas <surname>Malcher</surname></author>
  <year>2011</year>
  <title>Undecidability and Hierarchy Results for Parallel Communicating Finite Automata</title>
  <journal>Int. J. Found. Comput. Sci.</journal>
  <volume>22</volume>
  <pages>1577&#8211;1592</pages>
  <doi>10.1142/S0129054111008891</doi>
 </citation>
 <citation type="article" key="bordihn:2012:ccpcfa">
  <author>Henning <surname>Bordihn</surname></author>
  <author>Martin <surname>Kutrib</surname></author>
  <author>Andreas <surname>Malcher</surname></author>
  <year>2012</year>
  <title>On the Computational Capacity of Parallel Communicating Finite Automata</title>
  <journal>Int. J. Found. Comput. Sci.</journal>
  <volume>23</volume>
  <pages>713&#8211;732</pages>
  <doi>10.1142/S0129054112500062</doi>
 </citation>
 <citation type="article" key="Buchholz:1998:tcfoca:art">
  <author>Thomas <surname>Buchholz</surname></author>
  <author>Martin <surname>Kutrib</surname></author>
  <year>1998</year>
  <title>On time computability of functions in one-way cellular automata</title>
  <journal>Acta Inform.</journal>
  <volume>35</volume>
  <pages>329&#8211;352</pages>
  <doi>10.1007/s002360050123</doi>
 </citation>
 <citation type="article" key="Choudhary:2007:rnrpcnfae">
  <author>Ashish <surname>Choudhary</surname></author>
  <author>Kamala <surname>Krithivasan</surname></author>
  <author>Victor <surname>Mitrana</surname></author>
  <year>2007</year>
  <title>Returning and non-returning parallel communicating finite automata are equivalent</title>
  <journal>RAIRO Inform. Th&#233;or.</journal>
  <volume>41</volume>
  <pages>137&#8211;145</pages>
  <doi>10.1051/ita:2007014</doi>
 </citation>
 <citation type="book" key="Hopcroft:1979:itatlc:book">
  <author>John E. <surname>Hopcroft</surname></author>
  <author>Jeffrey D. <surname>Ullman</surname></author>
  <year>1979</year>
  <title>Introduction to Automata Theory, Languages, and Computation</title>
  <publisher>Addison-Wesley</publisher>
 </citation>
 <citation type="article" key="ibarra:1973:twmha">
  <author>Oscar H. <surname>Ibarra</surname></author>
  <year>1973</year>
  <title>On Two-way Multihead Automata</title>
  <journal>J. Comput. System Sci.</journal>
  <volume>7</volume>
  <pages>28&#8211;36</pages>
  <doi>10.1016/S0022-0000(73)80048-0</doi>
 </citation>
 <citation type="incollection" key="kutrib:2008:ca-cpv">
  <author>Martin <surname>Kutrib</surname></author>
  <year>2008</year>
  <title>Cellular Automata &#8211; A Computational Point of View</title>
  <booktitle>New Developments in Formal Languages and Applications</booktitle>
  <chapter>6</chapter>
  <publisher>Springer</publisher>
  <pages>183&#8211;227</pages>
  <doi>10.1007/978-3-540-78291-9_6</doi>
 </citation>
 <citation type="incollection" key="kutrib:2009:calt">
  <author>Martin <surname>Kutrib</surname></author>
  <year>2009</year>
  <title>Cellular Automata and Language Theory</title>
  <booktitle>Encyclopedia of Complexity and System Science</booktitle>
  <publisher>Springer</publisher>
  <pages>800&#8211;823</pages>
  <doi>10.1007/978-0-387-30440-3_54</doi>
 </citation>
 <citation type="inproceedings" key="kutrib:2010:tpwcc">
  <author>Martin <surname>Kutrib</surname></author>
  <author>Andreas <surname>Malcher</surname></author>
  <year>2011</year>
  <title>Two-Party Watson-Crick Computations</title>
  <booktitle>Implementation and Application of Automata (CIAA 2010)</booktitle>
  <series>LNCS</series>
  <volume>6482</volume>
  <publisher>Springer</publisher>
  <pages>191&#8211;200</pages>
  <doi>10.1007/978-3-642-18098-9_21</doi>
 </citation>
 <citation type="book" key="li:1993:itkca:book">
  <author>Ming <surname>Li</surname></author>
  <author>Paul M. B. <surname>Vit&#225;nyi</surname></author>
  <year>1993</year>
  <title>An Introduction to Kolmogorov Complexity and Its Applications</title>
  <publisher>Springer</publisher>
  <doi>10.1007/978-1-4757-3860-5</doi>
 </citation>
 <citation type="article" key="Malcher:2002:dccadq">
  <author>Andreas <surname>Malcher</surname></author>
  <year>2002</year>
  <title>Descriptional Complexity of Cellular Automata and Decidability Questions</title>
  <journal>J. Autom., Lang. Comb.</journal>
  <volume>7</volume>
  <pages>549&#8211;560</pages>
 </citation>
 <citation type="article" key="Martinvide:2002:pfascs">
  <author>Carlos <surname>Mart&#237;n-Vide</surname></author>
  <author>Alexandru <surname>Mateescu</surname></author>
  <author>Victor <surname>Mitrana</surname></author>
  <year>2002</year>
  <title>Parallel Finite Automata Systems Communicating by States</title>
  <journal>Int. J. Found. Comput. Sci.</journal>
  <volume>13</volume>
  <pages>733&#8211;749</pages>
  <doi>10.1142/S0129054102001424</doi>
 </citation>
 <citation type="article" key="mitrana:2000:odcipcfas">
  <author>Victor <surname>Mitrana</surname></author>
  <year>2000</year>
  <title>On the Degree of Communication in Parallel Communicating Finite Automata Systems</title>
  <journal>J. Autom., Lang. Comb.</journal>
  <volume>5</volume>
  <pages>301&#8211;314</pages>
 </citation>
 <citation type="inproceedings" key="otto:2013">
  <author>Friedrich <surname>Otto</surname></author>
  <year>2013</year>
  <title>Asynchronous PC systems of pushdown automata</title>
  <booktitle>Language and Automata Theory and Applications (LATA 2013)</booktitle>
  <series>LNCS</series>
  <volume>7810</volume>
  <publisher>Springer</publisher>
  <pages>456&#8211;467</pages>
  <doi>10.1007/978-3-642-37064-9_40</doi>
 </citation>
 <citation type="inproceedings" key="vollweiler:2013:aspcfa">
  <author>Marcel <surname>Vollweiler</surname></author>
  <year>2013</year>
  <title>Asynchronous systems of parallel communicating finite automata</title>
  <booktitle>Fifth Workshop on Non-Classical Models for Automata and Applications (NCMA 2013)</booktitle>
  <series>books@ocg.at</series>
  <volume>294</volume>
  <publisher>Austrian Computer Society</publisher>
  <address>Vienna</address>
  <pages>243&#8211;257</pages>
 </citation>
</bibliography>
