{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:35:36Z","timestamp":1753439736687,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001823","name":"Ministerstvo SkolstvI, Mladeze a Telovychovy","doi-asserted-by":"publisher","award":["LQ1602"],"award-info":[{"award-number":["LQ1602"]}],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00236-021-00413-x","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:01Z","timestamp":1642982701000},"page":"557-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A jumping $$5'\\rightarrow 3'$$ Watson\u2013Crick finite automata model"],"prefix":"10.1007","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5082-7861","authenticated-orcid":false,"given":"Radim","family":"Kocman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8309-0280","authenticated-orcid":false,"given":"Zbyn\u011bk","family":"K\u0159ivka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2341-0606","authenticated-orcid":false,"given":"Alexander","family":"Meduna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9494-6440","authenticated-orcid":false,"given":"Benedek","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"413_CR1","doi-asserted-by":"publisher","unstructured":"Beier, S., Holzer, M.: Decidability of right one-way jumping finite automata. In: DLT 2018, LNCS, vol. 11088, pp. 109\u2013120 (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_9","DOI":"10.1007\/978-3-319-98654-8_9"},{"key":"413_CR2","doi-asserted-by":"publisher","unstructured":"Beier, S., Holzer, M., Kutrib, M.: Operational state complexity and decidability of jumping finite automata. In: DLT 2017, LNCS, vol. 10396, pp. 96\u2013108 (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_6","DOI":"10.1007\/978-3-319-62809-7_6"},{"issue":"03","key":"413_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/S0129054116400165","volume":"27","author":"H Chigahara","year":"2016","unstructured":"Chigahara, H., Fazekas, S.Z., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27(03), 391\u2013405 (2016). https:\/\/doi.org\/10.1142\/S0129054116400165","journal-title":"Int. J. Found. Comput. Sci."},{"key":"413_CR4","doi-asserted-by":"publisher","unstructured":"Fazekas, S.Z., Hoshi, K., Yamamura, A.: Enhancement of automata with jumping modes. In: Automata 2019, LNCS, vol. 11525, pp. 62\u201376 (2019). https:\/\/doi.org\/10.1007\/978-3-030-20981-0_5","DOI":"10.1007\/978-3-030-20981-0_5"},{"key":"413_CR5","unstructured":"Fazekas, S.Z., Yamamura, A.: On regular languages accepted by one-way jumping finite automata. In: Eighth Workshop on Non-classical Models of Automata and Applications (NCMA 2016) Short papers, pp. 7\u201314 (2016)"},{"key":"413_CR6","doi-asserted-by":"publisher","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L.: Jumping finite automata: characterizations and complexity. In: CIAA 2015, LNCS, vol. 9223, pp. 89\u2013101. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-22360-5_8","DOI":"10.1007\/978-3-319-22360-5_8"},{"key":"413_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2016.07.006","volume":"679","author":"H Fernau","year":"2017","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679, 31\u201352 (2017). https:\/\/doi.org\/10.1016\/j.tcs.2016.07.006","journal-title":"Theor. Comput. Sci."},{"key":"413_CR8","unstructured":"Kocman, R., K\u0159ivka, Z., Meduna, A.: On double-jumping finite automata. In: Eighth Workshop on Non-classical Models of Automata and Applications (NCMA 2016), OCG, vol. 321, pp. 195\u2013210 (2016)"},{"issue":"2\u20134","key":"413_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1051\/ita\/2018013","volume":"52","author":"R Kocman","year":"2018","unstructured":"Kocman, R., K\u0159ivka, Z., Meduna, A.: On double-jumping finite automata and their closure properties. RAIRO Theor. Inf. Appl. 52(2\u20134), 185\u2013199 (2018). https:\/\/doi.org\/10.1051\/ita\/2018013","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"413_CR10","doi-asserted-by":"publisher","unstructured":"Kocman, R., Meduna, A.: On parallel versions of jumping finite automata. In: SDOT 2015, AICS, vol. 511, pp. 142\u2013149 (2016). https:\/\/doi.org\/10.1007\/978-3-319-46535-7_12","DOI":"10.1007\/978-3-319-46535-7_12"},{"key":"413_CR11","unstructured":"Kocman, R., Nagy, B., K\u0159ivka, Z., Meduna, A.: A jumping $$5^{\\prime }\\rightarrow 3^{\\prime }$$ Watson\u2013Crick finite automata model. In: Tenth Workshop on Non-classical Models of Automata and Applications (NCMA 2018), OCG, vol. 332, pp. 117\u2013132 (2018)"},{"key":"413_CR12","doi-asserted-by":"publisher","unstructured":"Kuske, D., Weigel, P.: The role of the complementarity relation in Watson\u2013Crick automata and sticker systems. In: DLT 2004, LNCS, vol. 3340, pp. 272\u2013283 (2005). https:\/\/doi.org\/10.1007\/978-3-540-30550-7_23","DOI":"10.1007\/978-3-540-30550-7_23"},{"issue":"6","key":"413_CR13","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1142\/S0129054115500409","volume":"26","author":"Z K\u0159ivka","year":"2015","unstructured":"K\u0159ivka, Z., Meduna, A.: Jumping grammars. Int. J. Found. Comput. Sci. 26(6), 709\u2013731 (2015). https:\/\/doi.org\/10.1142\/S0129054115500409","journal-title":"Int. J. Found. Comput. Sci."},{"key":"413_CR14","unstructured":"Madejski, G.: Jumping and pumping lemmas and their applications. In: Eighth Workshop on Non-classical Models of Automata and Applications (NCMA 2016) Short Papers, pp. 25\u201333 (2016)"},{"key":"413_CR15","doi-asserted-by":"publisher","unstructured":"Mahalingam, K., Raghavan, R., Mishra, U.K.: Watson\u2013Crick jumping finite automata. In: TAMC 2019, LNCS, vol. 11436, pp. 467\u2013480. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_29","DOI":"10.1007\/978-3-030-14812-6_29"},{"key":"413_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0501-5","volume-title":"Automata and Languages: Theory and Applications","author":"A Meduna","year":"2000","unstructured":"Meduna, A.: Automata and Languages: Theory and Applications. Springer, London (2000)"},{"issue":"1","key":"413_CR17","doi-asserted-by":"publisher","first-page":"51","DOI":"10.3233\/FI-2017-1512","volume":"152","author":"A Meduna","year":"2017","unstructured":"Meduna, A., Soukup, O.: Jumping scattered context grammars. Fundam. Inf. 152(1), 51\u201386 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1512","journal-title":"Fundam. Inf."},{"key":"413_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63100-4","volume-title":"Modern Language Models and Computation: Theory with Applications","author":"A Meduna","year":"2017","unstructured":"Meduna, A., Soukup, O.: Modern Language Models and Computation: Theory with Applications. Springer, Berlin (2017). https:\/\/doi.org\/10.1007\/978-3-319-63100-4"},{"key":"413_CR19","volume-title":"Scattered Context Grammars and Their Applications","author":"A Meduna","year":"2010","unstructured":"Meduna, A., Techet, J.: Scattered Context Grammars and Their Applications. WIT Press, Southampton (2010)"},{"issue":"7","key":"413_CR20","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1142\/S0129054112500244","volume":"23","author":"A Meduna","year":"2012","unstructured":"Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555\u20131578 (2012). https:\/\/doi.org\/10.1142\/S0129054112500244","journal-title":"Int. J. Found. Comput. Sci."},{"key":"413_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-0369-6","volume-title":"Regulated Grammars and Automata","author":"A Meduna","year":"2014","unstructured":"Meduna, A., Zemek, P.: Regulated Grammars and Automata. Springer, Berlin (2014)"},{"key":"413_CR22","unstructured":"Nagy, B.: On $$5^{\\prime }\\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite automata. In: The 13th International Meeting on DNA Computing (DNA13), pp. 327\u2013336 (2007)"},{"key":"413_CR23","doi-asserted-by":"publisher","unstructured":"Nagy, B.: On $$5^{\\prime }\\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite automata. In: DNA 13, LNCS, vol. 4848, pp. 256\u2013262 (2008). https:\/\/doi.org\/10.1007\/978-3-540-77962-9_27","DOI":"10.1007\/978-3-540-77962-9_27"},{"key":"413_CR24","first-page":"39","volume-title":"Sequence and Genome Analysis II\u2013Methods and Applications","author":"B Nagy","year":"2010","unstructured":"Nagy, B.: $$5^{\\prime }\\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite automata. In: Fung, G. (ed.) Sequence and Genome Analysis II\u2013Methods and Applications, pp. 39\u201356. iConcept Press, Hong Kong (2010)"},{"issue":"4","key":"413_CR25","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1093\/logcom\/exr049","volume":"23","author":"B Nagy","year":"2013","unstructured":"Nagy, B.: On a hierarchy of $$5^{\\prime }\\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite automata languages. J. Log. Comput. 23(4), 855\u2013872 (2013). https:\/\/doi.org\/10.1093\/logcom\/exr049","journal-title":"J. Log. Comput."},{"key":"413_CR26","unstructured":"Nagy, B., Kov\u00e1cs, Z.: On simple $$5^{\\prime }\\rightarrow 3^{\\prime }$$ sensing Watson\u2013Crick finite-state transducers. In: Eleventh Workshop on Non-classical Models of Automata and Applications (NCMA 2019), pp. 155\u2013170 (2019)"},{"key":"413_CR27","doi-asserted-by":"publisher","unstructured":"Nagy, B., Otto, F.: Two-head finite-state acceptors with translucent letters. In: SOFSEM 2019, LNCS, vol. 11376, pp. 406\u2013418 (2019). https:\/\/doi.org\/10.1007\/978-3-030-10801-4_32","DOI":"10.1007\/978-3-030-10801-4_32"},{"key":"413_CR28","doi-asserted-by":"publisher","unstructured":"Nagy, B., Otto, F.: Linear automata with translucent letters and linear context-free trace languages. RAIRO Theor. Informatics Appl. 54, 3 (2020). https:\/\/doi.org\/10.1051\/ita\/2020002","DOI":"10.1051\/ita\/2020002"},{"key":"413_CR29","doi-asserted-by":"publisher","unstructured":"Nagy, B., Parchami, S.: On deterministic sensing $$5^{\\prime }\\rightarrow 3^{\\prime }$$ Watson\u2013Crick finite automata: a full hierarchy in 2detLIN. Acta Inform. 58(3), 153\u2013175 (2021). https:\/\/doi.org\/10.1007\/s00236-019-00362-6","DOI":"10.1007\/s00236-019-00362-6"},{"key":"413_CR30","doi-asserted-by":"publisher","unstructured":"Nagy, B., Parchami, S., Mir-Mohammad-Sadeghi, H.: A new sensing $$5^{\\prime }\\rightarrow 3^{\\prime }$$ Watson\u2013Crick automata concept. In: AFL 2017, EPTCS, vol. 252, pp. 195\u2013204 (2017). https:\/\/doi.org\/10.4204\/EPTCS.252.19","DOI":"10.4204\/EPTCS.252.19"},{"key":"413_CR31","doi-asserted-by":"publisher","unstructured":"Parchami, S., Nagy, B.: Deterministic sensing $$5^{\\prime }\\rightarrow 3^{\\prime }$$ Watson\u2013Crick automata without sensing parameter. In: UCNC 2018, LNCS, vol. 10876, pp. 173\u2013187 (2018). https:\/\/doi.org\/10.1007\/978-3-319-92435-9_13","DOI":"10.1007\/978-3-319-92435-9_13"},{"key":"413_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G Paun","year":"1998","unstructured":"Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Berlin Heidelberg (1998)"},{"key":"413_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6","volume-title":"Handbook of Formal Languages, Linear Modeling: Background and Application","author":"G Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, Linear Modeling: Background and Application, vol. 2. Springer, Berlin (1997)"},{"issue":"1","key":"413_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129054118500016","volume":"29","author":"V Vorel","year":"2018","unstructured":"Vorel, V.: On basic properties of jumping finite automata. Int. J. Found. Comput. Sci. 29(1), 1\u201315 (2018). https:\/\/doi.org\/10.1142\/S0129054118500016","journal-title":"Int. J. Found. Comput. Sci."},{"key":"413_CR35","volume-title":"Theory of Computation: A Primer","author":"D Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation: A Primer. Addison-Wesley, Boston (1987)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-021-00413-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-021-00413-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-021-00413-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T09:02:52Z","timestamp":1664010172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-021-00413-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,24]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["413"],"URL":"https:\/\/doi.org\/10.1007\/s00236-021-00413-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2022,1,24]]},"assertion":[{"value":"17 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}