论文信息 - Language Recognition Power of Watson-Crick Automata: Multiheads and Sensing

Language Recognition Power of Watson-Crick Automata: Multiheads and Sensing

A Watson-Crick automaton is introduced as a computational model of DNA computing framework. In this paper, we introduce a 3-head reverse Watson-Crick finite automaton having three read-only heads but no sensing power. We show that the class of 3-head reverse Watson-Crick finite automata includes the class of simple sticker language and full reading sensing 5'->;3' Watson-Crick finite automata.

Kunio Aizawa | Kazuki Murakami | Masayuki Aoyama

[1] Rudolf Freund,et al. Watson-Crick finite automata , 1997, DNA Based Computers.

[2] Peter Leupold,et al. 5' -> 3' Watson-Crick AutomataWith Several Runs , 2010, Fundam. Informaticae.

[3] Benedek Nagy,et al. On 5' --> 3' Sensing Watson-Crick Finite Automata , 2007, DNA.

[4] Sadaki Hirose,et al. The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages , 2006, IEICE Trans. Inf. Syst..

[5] Sadaki Hirose,et al. Some Relations between Watson-Crick Finite Automata and Chomsky Hierarchy , 2004, IEICE Trans. Inf. Syst..

[6] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.

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

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