{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:41:55Z","timestamp":1753440115982,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T00:00:00Z","timestamp":1629244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11047-021-09869-9","type":"journal-article","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T14:03:20Z","timestamp":1629295400000},"page":"679-691","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["$$5'\\rightarrow 3'$$ Watson\u2013Crick automata languages-without sensing parameter"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9494-6440","authenticated-orcid":false,"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaghayegh","family":"Parchami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,18]]},"reference":[{"key":"9869_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"226","author":"LM Adleman","year":"1994","unstructured":"Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 226:1021\u20131024","journal-title":"Science"},{"key":"9869_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0019-9958(64)90294-3","volume":"7","author":"V Amar","year":"1964","unstructured":"Amar V, Putzolu GR (1964) On a family of linear grammars. Inform Control 7:283\u2013291","journal-title":"Inform Control"},{"key":"9869_CR3","doi-asserted-by":"crossref","unstructured":"Csuhaj-Varj\u00fa E, Freund R, Vaszil Gy (2015) A connection between red-green turing machines and Watson\u2013Crick T0L Systems. MCU 31\u201344","DOI":"10.1007\/978-3-319-23111-2_3"},{"key":"9869_CR4","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1308\/147363506X101210","volume":"88","author":"E Czeizler","year":"2006","unstructured":"Czeizler E, Czeizler EA (2006) Short survey on Watson\u2013Crick automata. Bull EATCS 88:104\u2013119","journal-title":"Bull EATCS"},{"key":"9869_CR5","unstructured":"Freund R, P\u0103un G, Rozenberg G, Salomaa A (1997) A Watson\u2013Crick finite automata, In: 3rd DIMACS Sympozium On DNA Based Computers, Philadelphia, pp. 305\u2013317"},{"issue":"3","key":"9869_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s11047-011-9290-9","volume":"11","author":"L Heged\u00fcs","year":"2012","unstructured":"Heged\u00fcs L, Nagy B, Egecioglu \u00d6 (2012) Stateless multicounter $$5^{\\prime } \\rightarrow 3^{\\prime }$$ Watson\u2013Crick automata: the deterministic case. Nat Comput 11(3):361\u2013368","journal-title":"Nat Comput"},{"key":"9869_CR7","volume-title":"Introduction to automata theory, languages and computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft JE, Ullman JE (1979) Introduction to automata theory, languages and computation. Addison-Wesley, Boston"},{"key":"9869_CR8","unstructured":"Kocman R, Nagy B, Krivka Z, Meduna A (2018) A jumping $$5^{\\prime } \\rightarrow 3^{\\prime }$$ Watson\u2013Crick finite automata model. NCMA 2018: Tenth workshop on non-classical models of automata and applications, Kosice, Slovakia, pp. 117\u2013132"},{"key":"9869_CR9","doi-asserted-by":"crossref","unstructured":"Kuske D, Weigel P (2004) The role of the complementarity relation in Watson\u2013Crick automata and sticker systems, In: Developments in language theory, DLT 2004, Lecture Notes in Computer Science, LNCS 3340, Springer, Berlin, Heidelberg, pp. 272\u2013283","DOI":"10.1007\/978-3-540-30550-7_23"},{"key":"9869_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3233\/FI-2010-336","volume":"104","author":"P Leupold","year":"2010","unstructured":"Leupold P, Nagy B (2010) $$5^{\\prime } \\rightarrow 3^{\\prime }$$ Watson\u2013Crick automata with several runs. Fundam Inform 104:71\u201391","journal-title":"Fundam Inform"},{"key":"9869_CR11","first-page":"351","volume-title":"ICTAC 2007. LNCS 4711","author":"R Loukanova","year":"2007","unstructured":"Loukanova R (2007) Linear context free languages. In: Jones C, Liu Z, Woodcock J (eds) ICTAC 2007. LNCS 4711. Springer, Heidelberg, pp. 351\u2013365"},{"key":"9869_CR12","unstructured":"Nagy B (2007) On $$5^{\\prime } \\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite automata, DNA13: The 13th International Meeting on DNA Computing (Preliminary proceedings), Memphis, Tennessee, USA, pp. 327\u2013336"},{"key":"9869_CR13","doi-asserted-by":"crossref","unstructured":"Nagy (2008) On $$5^{\\prime } \\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite automata, In: Garzon MH, Yan H (Eds): DNA Computing. DNA 2007: Selected revised papers, Lecture Notes in Computer Science, LNCS 4848, Springer, Berlin, Heidelberg, pp. 256\u2013262","DOI":"10.1007\/978-3-540-77962-9_27"},{"key":"9869_CR14","unstructured":"Nagy B (2009) On a hierarchy of $$5^{\\prime } \\rightarrow 3^{\\prime }$$ sensing WK finite automata languages, In: Computaility in Europe, CiE 2009: mathematical theory and computational practice, Abstract Booklet, Heidelberg, pp. 266\u2013275"},{"key":"9869_CR15","unstructured":"Nagy B (2010) $$5^{\\prime } \\rightarrow 3^{\\prime }$$ Sensing Watson\u2013Crick Finite Automata, pp. 39\u201356, In: Gabriel Fung (ed.): Sequence and Genome Analysis II \u2013 Methods and Applications, iConcept Press"},{"issue":"4","key":"9869_CR16","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1093\/logcom\/exr049","volume":"23","author":"B Nagy","year":"2013","unstructured":"Nagy B (2013) On a hierarchy of $$5^{\\prime } \\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite automata languages. J Logic Comput 23(4):855\u2013872","journal-title":"J Logic Comput"},{"key":"9869_CR17","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.ins.2020.06.031","volume":"537","author":"B Nagy","year":"2020","unstructured":"Nagy B (2020) $$5^{\\prime } \\rightarrow 3^{\\prime }$$ Watson\u2013Crick pushdown automata. Inform Sci 537:452\u2013466","journal-title":"Inform Sci"},{"key":"9869_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-021-09865-z","author":"B Nagy","year":"2021","unstructured":"Nagy B (2021) $$5^{\\prime } \\rightarrow 3^{\\prime }$$ Watson\u2013Crick pushdown automata. Nat Comput.  https:\/\/doi.org\/10.1007\/s11047-021-09865-z","journal-title":"Nat Comput"},{"key":"9869_CR18","unstructured":"Nagy B, Kov\u00e1cs Z (2019) On simple $$5^{\\prime } \\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite-state transducers, NCMA 2019: Eleventh Workshop on Non-Classical Models of Automata and Applications, Valencia, Spain, 155\u2013170"},{"key":"9869_CR19","doi-asserted-by":"crossref","unstructured":"Nagy B, Otto F (2020) Linear Automata with Translucent Letters And Linear Context-Free Trace Languages, RAIRO Theoretical Informatics and Applications - RAIRO ITA 54 , article number 3 (23 pages)","DOI":"10.1051\/ita\/2020002"},{"key":"9869_CR20","doi-asserted-by":"crossref","unstructured":"Nagy B, Parchami Sh (2021) On deterministic sensing $$5^{\\prime } \\rightarrow 3^{\\prime }$$ Watson\u2013Crick finite automata: a full hierarchy in 2detLIN, Acta Informatica 58, pp. 153\u2013175 (2021)","DOI":"10.1007\/s00236-019-00362-6"},{"key":"9869_CR21","doi-asserted-by":"crossref","unstructured":"Nagy B, Parchami Sh, Sadeghi HMM (2017) A new sensing $$5^{\\prime }\\rightarrow 3^{\\prime }$$ Watson\u2013Crick automata concept, AFL 2017, Proceedings 15th International Conference on Automata and Formal Languages, EPTCS 252, pp. 195\u2013204","DOI":"10.4204\/EPTCS.252.19"},{"key":"9869_CR22","unstructured":"P\u0103un Gh, Rozenberg G, Salomaa A (2002) DNA Computing: New Computing Paradigms, Springer-Verlag"},{"key":"9869_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0019-9958(67)80006-8","volume":"10","author":"AL Rosenberg","year":"1967","unstructured":"Rosenberg AL (1967) A machine realization of the linear context-free languages. Inform Control 10:175\u2013188","journal-title":"Inform Control"},{"volume-title":"Handbook of formal languages","year":"1997","key":"9869_CR24","unstructured":"Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages. Springer, Berlin"},{"issue":"4","key":"9869_CR25","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s11047-012-9329-6","volume":"11","author":"D Sears","year":"2012","unstructured":"Sears D, Salomaa K (2012) Extended Watson\u2013Crick L systems with regular trigger languages and restricted derivation modes. Nat Comput 11(4):653\u2013664","journal-title":"Nat Comput"},{"key":"9869_CR26","first-page":"187","volume":"83","author":"JM Sempere","year":"2004","unstructured":"Sempere JM (2004) A representation theorem for languages accepted by Watson\u2013Crick finite atomata. Bull EATCS 83:187\u2013191","journal-title":"Bull EATCS"},{"key":"9869_CR27","unstructured":"Sempere JM (2018) On the application of Watson\u2013Crick finite automata for the resolution of bioinformatic problems, NCMA 2018 (invited talk), pp. 29\u201330"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-021-09869-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-021-09869-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-021-09869-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T04:48:29Z","timestamp":1669610909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-021-09869-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,18]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["9869"],"URL":"https:\/\/doi.org\/10.1007\/s11047-021-09869-9","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2021,8,18]]},"assertion":[{"value":"27 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}