{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:29:12Z","timestamp":1747189752035,"version":"3.40.5"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:p> Watson\u2013Crick jumping finite automata work on tapes which are double stranded sequences of symbols similar to that of Watson\u2013Crick automata. The double stranded sequence is scanned in a discontinuous manner. That is, after reading a double stranded string, the automata can jump over some subsequence and continue scanning depending on the rule. Some variants of such automata are 1-limited, No state, All final and Simple Watson\u2013Crick jumping finite automata. The comparison of the languages accepted by these variants with the language classes in Chomsky hierarchy has been carried out. We investigate some closure properties. We also try to place the duplication closure of a word in Watson\u2013Crick jumping finite automata family. We have discussed the closure property of Watson\u2013Crick jumping finite automata family under duplication operations. <\/jats:p>","DOI":"10.1142\/s0129054120500331","type":"journal-article","created":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T09:30:51Z","timestamp":1605605451000},"page":"891-913","source":"Crossref","is-referenced-by-count":3,"title":["Watson\u2013Crick Jumping Finite Automata"],"prefix":"10.1142","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2418-0512","authenticated-orcid":false,"given":"Kalpana","family":"Mahalingam","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai 600036, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3375-5288","authenticated-orcid":false,"given":"Ujjwal Kumar","family":"Mishra","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai 600036, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5780-7417","authenticated-orcid":false,"given":"Rama","family":"Raghavan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai 600036, India"}]}],"member":"219","published-online":{"date-parts":[[2020,11,16]]},"reference":[{"key":"S0129054120500331BIB001","doi-asserted-by":"crossref","DOI":"10.1002\/9780470570418","volume-title":"Evolutionary Genomics and Systems Biology","author":"Caetano-Anoll\u00e9s G.","year":"2010"},{"key":"S0129054120500331BIB002","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054116400165"},{"key":"S0129054120500331BIB003","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-319-21819-9_11","volume-title":"Unconventional Computation and Natural Computation","volume":"9252","author":"Cho D. J.","year":"2015"},{"key":"S0129054120500331BIB004","first-page":"133","author":"Dassow J.","year":"1999","journal-title":"Bull. EATCS 69"},{"issue":"1","key":"S0129054120500331BIB005","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0304-3975(01)00096-2","volume":"270","author":"Dassow J.","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"S0129054120500331BIB006","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-319-08846-4_13","volume-title":"Implementation and Application of Automata","volume":"8587","author":"Dumitran M.","year":"2014"},{"issue":"3","key":"S0129054120500331BIB007","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(84)90129-X","volume":"8","author":"Ehrenfeucht A.","year":"1984","journal-title":"Discr. Appl. Math."},{"key":"S0129054120500331BIB008","first-page":"305","volume-title":"The Proc. of the 3rd Annual DIMACS Symposium on DNA Based Computers","author":"Freund R.","year":"1997"},{"key":"S0129054120500331BIB010","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-540-85780-8_33","volume-title":"Developments in Language Theory","volume":"5257","author":"Ito M.","year":"2008"},{"key":"S0129054120500331BIB011","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/11779148_22","volume-title":"Developments in Language Theory","volume":"4036","author":"Ito M.","year":"2006"},{"issue":"5","key":"S0129054120500331BIB012","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s002360050125","volume":"35","author":"Kari L.","year":"1998","journal-title":"Acta Informatica"},{"volume-title":"Introduction to Formal Languages, Automata Theory and Computation","year":"2009","author":"Krithivasan K.","key":"S0129054120500331BIB013"},{"key":"S0129054120500331BIB014","series-title":"LNCS","first-page":"272","volume-title":"Developments in Language Theory, DLT 2004","volume":"3340","author":"Kuske D."},{"issue":"3","key":"S0129054120500331BIB015","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.dam.2004.10.003","volume":"146","author":"Leupold P.","year":"2005","journal-title":"Discr. Appl. Math."},{"key":"S0129054120500331BIB016","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-540-24635-0_22","volume-title":"Aspects of Molecular Computing","volume":"2950","author":"Leupold P.","year":"2004"},{"issue":"7","key":"S0129054120500331BIB017","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1016\/j.jcss.2014.02.011","volume":"80","author":"Lopez J. G.","year":"2014","journal-title":"J. Comput. Syst. Sci."},{"key":"S0129054120500331BIB018","unstructured":"C. Martin-Vide,  Gh. P\u0103un,  G. Rozenberg and  A. Salomaa,  Universality Results for Finite H Systems and for Watson\u2013Crick Finite Automata in Computing with Bio-Molecules, Theory and Experiments,   Gh. P\u0103un (ed.)  (Springer,  Berlin,  1998),  pp. 200\u2013220."},{"key":"S0129054120500331BIB019","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054112500244"},{"key":"S0129054120500331BIB020","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"P\u0103un Gh.","year":"1998","edition":"1"},{"issue":"1","key":"S0129054120500331BIB021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0129054118500016","volume":"29","author":"Vorel V.","year":"2018","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"S0129054120500331BIB023","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"Wanger R. A.","year":"1974","journal-title":"J. ACM"},{"volume-title":"Languages and Codes","year":"2005","author":"Yu S. S.","key":"S0129054120500331BIB024"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054120500331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,16]],"date-time":"2020-12-16T10:15:38Z","timestamp":1608113738000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054120500331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":22,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["10.1142\/S0129054120500331"],"URL":"https:\/\/doi.org\/10.1142\/s0129054120500331","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2020,11]]}}}