Binding-blocking automata

References

• Balan , M. S. , Krithivasan , K. and Sivasubramayam , Y. Peptide computing: Universality and complexity . Proceedings of Seventh International Conference on DNA Based Computers (DNA7) . Edited by: Jonoska , N. and Seeman , N. C. pp. 290 – 299 . Berlin, Heidelberg : Springer-Verlag . Lecture Notes in Computer Science, Vol. 2340
   Google Scholar
• Balan , M. S. 2007 . Automaton Models Inspired by Peptide Computing , 1 – 15 . Kingston , , Canada : Language Theory in Biocomputing Workshop, Unconventional Computation .
   Google Scholar
• Balan , M. S. , Jürgensen , H. and Krithivasan , K. Peptide computing: A survey . Formal Language Aspects of Natural Computing, Proceedings of Research Level Discussion on Natural Computing . Edited by: Krithivasan , K. and Rama , R. pp. 63 – 76 . Chennai : Ramanujan Mathematical Society . Lecture Notes Series, No. 3
   Google Scholar
• Balan , M. S. 2008 . Complexity measures for binding-blocking automata . J. Autom. Lang. Comb. , 13 : 105 – 123 .
   Google Scholar
• Balan , M. S. and Jürgensen , H. 2008 . On the universality of peptide computing . Nat. Comput. , 7 : 71 – 94 . (doi:10.1007/s11047-007-9045-9)
   Google Scholar
• Balan , M. S. Properties of Binding-blocking Automata: A study . Proceedings of Sixth International Conference on Bio-Inspired Computing: Theories and Applications . pp. 211 – 215 . Los Almitos, CA : IEEE Computer Society .
   Google Scholar
• Chrobak , M. 1986 . Hierarchies of one-way multihead automata languages . Theor. Comput. Sci. , 48 : 153 – 181 . (doi:10.1016/0304-3975(86)90093-9)
   Web of Science ®Google Scholar
• Csuhaj-Varjú , E. and Vaszil , G. P automata or purely communicating accepting P systems . WMC-CdeA . Edited by: Pǎun , G. , Rozenberg , G. , Salomaa , A. and Zandron , C. pp. 219 – 233 . Berlin : Springer . Lecture Notes in Computer Science, Vol. 2597
   Google Scholar
• Dassow , J. 2004 . Grammars with regulated rewriting . Stud. Fuzziness Soft Comput. , 148 : 249 – 274 . (doi:10.1007/978-3-540-39886-8_13)
   Google Scholar
• Dassow , J. and Păun , G. 1989 . Regulated Rewriting in Formal Language Theory , Berlin : Springer .
   Google Scholar
• Freund , R. , Păun , G. , Rozenberg , G. and Salomaa , A. Watson–Crick Finite Automata . Proceedings of the Third Annual DIMACS Symposium on DNA Based Computers . Philadelphia, PA . pp. 305 – 317 .
   Google Scholar
• Hug , H. and Schuler , R. 2001 . Strategies for the development of a peptide computer . Bioinformatics , 17 : 364 – 368 . (doi:10.1093/bioinformatics/17.4.364)
   PubMed Web of Science ®Google Scholar
• Ibarra , O. H. 1973 . On two-way multihead automata . J. Comput. Syst. Sci. , 7 : 28 – 36 . (doi:10.1016/S0022-0000(73)80048-0)
   Google Scholar
• Ibarra , O. and Kim , C. 1975 . On 3-head versus 2-head finite automata . Acta Inform. , 4 : 193 – 200 . (doi:10.1007/BF00288748)
   Google Scholar
• Jancar , P. , Mráz , F. and Plátek , M. Characterization of context-free languages by erasing automata . Mathematical Foundations of Computer Science 1992, 17th International Symposium, MFCS’92, Prague, Czechoslovakia, August 24–28, 1992, Proceedings . Edited by: Havel , I. M. and Koubek , V. pp. 307 – 314 . Berlin : Springer . Lecture Notes in Computer Science, Vol. 629
   Google Scholar
• Jancar , P. , Mráz , F. , Plátek , M. , Procházka , M. and Vogel , J. 1995 . “ Restarting automata, marcus grammars and context-free languages ” . In Developments in Language Theory , Edited by: Dassow , J. , Rozenberg , G. and Salomaa , A. 102 – 111 . Singapore : World Scientific .
   Google Scholar
• Kutylowski , M. 1991 . Mutihead one-way finite automata . Theor. Comput. Sci. , 85 : 135 – 153 . (doi:10.1016/0304-3975(91)90051-3)
   Web of Science ®Google Scholar
• Leupold , P. and Nagy , B. 5’ → 3’ Watson–Crick automata with several runs . Fundamenta Informaticae , 104 ( 1 ) 71 – 91 .
   Web of Science ®Google Scholar
• Monien , B. 1980 . Two-way multihead automata over a one-letter alphabet . Inform. Theor. Appl. , 14 : 67 – 82 .
   Web of Science ®Google Scholar
• Nagy , B. On 5’ → 3’ Sensing Watson–Crick Finite Automata . DNA13’07: Proceedings of the 13th International Conference on DNA Computing . Memphis, TN, USA . pp. 256 – 262 . Berlin : Springer-Verlag .
   Google Scholar
• Nagy , B. and Otto , F. CD-systems of stateless deterministic R(1)-automata accept all rational trace languages . Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24–28, 2010. Proceedings . Edited by: Dediu , A.-H. , Fernau , H. and Martín-Vide , C. pp. 463 – 474 . Berlin : Springer . Lecture Notes in Computer Science, Vol. 6031
   Google Scholar
• Otto , F. Restarting automata and their relations to the Chomsky hierarchy . Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7–11, 2003, Proceedings . Edited by: Ésik , Z. and Fülöp , Z. pp. 55 – 74 . Berlin : Springer . Lecture Notes in Computer Science, Vol. 2710
   Google Scholar
• Otto , F. 2006 . “ Restarting automata ” . In Recent Advances in Formal Languages and Applications , Edited by: Ésik , Z. , Martín-Vide , C. and Mitrana , V. 269 – 303 . Berlin : Springer . Studies in Computational Intelligence, Vol. 25
   Google Scholar
• Păun , G. , Rozenberg , G. and Salomaa , A. 1998 . DNA Computing , Berlin : Springer-Verlag .
   Google Scholar
• Rosenberg , A. 1966 . On multihead finite automata . 10 ( BM J. Res. Devel ) : 388 – 394 .
   Google Scholar
• Yao , A. and Rivest , R. 1978 . K+1 heads are better than K . J. Assoc. Comput. Mach. , 25 : 337 – 340 . (doi:10.1145/322063.322076)
   Web of Science ®Google Scholar