On the descriptional complexity of Watson-Crick automata

Watson-Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity of Watson-Crick automata initiated by Paun et al. [A. Paun, M. Paun, State and transition complexity of Watson-Crick finite automata, in: G. Ciobanu, G. Paun (Eds.), Fundamentals of Computation Theory, FCT'99, in: LNCS, vol. 1684, 1999, pp. 409-420]. In particular, we show that any finite language, as well as any unary regular language, can be recognized by a Watson-Crick automaton with only two, and respectively three, states. Also, we formally define the notion of determinism for these systems. Contrary to the case of non-deterministic Watson-Crick automata, we show that, for deterministic ones, the complementarity relation plays a major role in the acceptance power of these systems.

[1]  Ehud Shapiro,et al.  Bringing DNA computers to life , 2006 .

[2]  Gheorghe Paun,et al.  Simulation Algorithms for Computational Systems Biology , 2017, Texts in Theoretical Computer Science. An EATCS Series.

[3]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[4]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[5]  Eric A. Althoff,et al.  Kemp elimination catalysts by computational enzyme design , 2008, Nature.

[6]  Arnold L. Rosenberg.  On multi-head finite automata , 1965, SWCT.

[7]  Sheng Yu,et al.  State Complexity of Finite and Infinite Regular Languages , 2002, Bull. EATCS.

[8]  Elena Petre,et al.  Watson-Crick ω-automata , 2003 .

[9]  Andrei Paun,et al.  State and Transition Complexity of Watson-Crick Finite Automata , 1999, FCT.

[10]  Oscar H. Ibarra,et al.  On partially blind multihead finite automata , 2006, Theor. Comput. Sci..

[11]  Eugen Czeizler,et al.  A Short Survey on Watson-Crick Automata , 2006, Bull. EATCS.

[12]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[13]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[14]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[15]  Dietrich Kuske,et al.  The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems , 2004, Developments in Language Theory.

[16]  Lila Kari,et al.  Watson-Crick automata: determinism and state complexity , 2008, DCFS.

[17]  Juraj Hromkovic,et al.  Descriptional Complexity of Finite Automata: Concepts and Open Problems , 2002, J. Autom. Lang. Comb..