On the power of parallel communicating Watson-Crick automata systems

  • Authors:

  • Elena Czeizler;Eugen Czeizler

  • Affiliations:

  • Department of Mathematics, University of Turku, Finland and Turku Centre for Computer Science, Turku, Finland;Department of Mathematics, University of Turku, Finland and Turku Centre for Computer Science, Turku, Finland

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 5.23

Visualization

Abstract

Parallel communicating Watson-Crick automata systems were introduced in [E. Czeizler, E. Czeizler, Parallel communicating Watson-Crick automata systems, in: Z. Ésik, Z. Fülöp (Eds.), Proc. Automata and Formal Languages, Dobogókö, Hungary, 2005, pp. 83-96] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [D. Kuske, P. Weigel, The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems, DLT 2004, Lecture Notes in Computer Science, Vol. 3340, Auckland, New Zealand, 2004, pp. 272-283], that for Watson-Crick finite automata, the complementarity relation plays no active role. However, this is not the case when considering parallel communicating Watson-Crick automata systems. In this paper we prove that non-injective complementarity relations increase the accepting power of these systems. We also prove that although Watson-Crick automata are equivalent to two-head finite automata, this equivalence is not preserved when comparing parallel communicating Watson-Crick automata systems and multi-head finite automata.