{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T01:24:38Z","timestamp":1768008278055,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T00:00:00Z","timestamp":1615248000000},"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,3]]},"DOI":"10.1007\/s11047-021-09844-4","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T12:58:28Z","timestamp":1615294708000},"page":"17-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The effect of jumping modes on various automata models"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5319-0395","authenticated-orcid":false,"given":"Szil\u00e1rd Zsolt","family":"Fazekas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaito","family":"Hoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Yamamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,9]]},"reference":[{"key":"9844_CR1","doi-asserted-by":"publisher","unstructured":"Beier S, Holzer M (2018) Decidability of right one-way jumping finite automata. In: Hoshi M, Seki S (eds.) Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings, Lecture Notes in Computer Science 11088: 109\u2013120. Springer. https:\/\/doi.org\/10.1007\/978-3-319-98654-8_9","DOI":"10.1007\/978-3-319-98654-8_9"},{"key":"9844_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-030-23247-4_5","volume-title":"Descriptional complexity of formal systems","author":"S Beier","year":"2019","unstructured":"Beier S, Holzer M (2019) Nondeterministic right one-way jumping finite automata (extended abstract). In: Hospod\u00e1r M, Jir\u00e1skov\u00e1 G, Konstantinidis S (eds) Descriptional complexity of formal systems. Springer, Cham, pp 74\u201385"},{"key":"9844_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2019.03.044","volume":"798","author":"S Beier","year":"2019","unstructured":"Beier S, Holzer M (2019) Properties of right one-way jumping finite automata. Theor Comput Sci 798:78\u201394","journal-title":"Theor Comput Sci"},{"key":"9844_CR4","doi-asserted-by":"publisher","unstructured":"Beier S, Holzer M, Kutrib M (2017) Operational state complexity and decidability of jumping finite automata. In: \u00c9.\u00a0Charlier, J.\u00a0Leroy, M.\u00a0Rigo (eds.) Developments in Language Theory - 21st International Conference, DLT 2017, Li\u00e8ge, Belgium, August 7-11, 2017, Proceedings, Lecture Notes in Computer Science, vol. 10396, pp. 96\u2013108. Springer. https:\/\/doi.org\/10.1007\/978-3-319-62809-7_6","DOI":"10.1007\/978-3-319-62809-7_6"},{"issue":"3","key":"9844_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/S0129054116400165","volume":"27","author":"H Chigahara","year":"2016","unstructured":"Chigahara H, Fazekas SZ, Yamamura A (2016) One-way jumping finite automata. Int J Found Comput Sci 27(3):391\u2013405. https:\/\/doi.org\/10.1142\/S0129054116400165","journal-title":"Int J Found Comput Sci"},{"key":"9844_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-20981-0_5","volume-title":"Cellular automata and discrete complex systems","author":"SZ Fazekas","year":"2019","unstructured":"Fazekas SZ, Hoshi K, Yamamura A (2019) Enhancement of automata with jumping modes. In: Castillo-Ramirez A, de Oliveira PPB (eds) Cellular automata and discrete complex systems. Springer, Cham, pp 62\u201376"},{"key":"9844_CR7","doi-asserted-by":"publisher","unstructured":"Fazekas SZ, Hoshi K, Yamamura A (2020) Two-way jumping automata. In: M.\u00a0Li (ed.) Frontiers in Algorithmics - 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings, Lecture Notes in Computer Science, vol. 12340, pp. 108\u2013120. Springer. https:\/\/doi.org\/10.1007\/978-3-030-59901-0_10","DOI":"10.1007\/978-3-030-59901-0_10"},{"key":"9844_CR8","unstructured":"Fazekas SZ, Yamamura A (2016) On regular languages accepted by one-way jumping finite automata. In: 8th NCMA, Debrecen, Hungary, Short Papers, pp. 7\u201314. sterreichische Computer Gesellschaft"},{"key":"9844_CR9","doi-asserted-by":"publisher","unstructured":"Fernau H, Paramasivan M, Schmid ML (2015) Jumping finite automata: Characterizations and complexity. In: Drewes F (ed.) Implementation and Application of Automata - 20th International Conference, CIAA 2015, Ume\u00e5, Sweden, August 18-21, 2015, Proceedings, Lecture Notes in Computer Science, 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":"9844_CR10","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 ML, Vorel V (2017) Characterization and complexity results on jumping finite automata. Theor Comput Sci 679:31\u201352. https:\/\/doi.org\/10.1016\/j.tcs.2016.07.006","journal-title":"Theor Comput Sci"},{"key":"9844_CR11","unstructured":"Hopcroft JE, Ullman JD (1979) Introduction to Automata Theory. Addison-Wesley, Languages and Computation"},{"key":"9844_CR12","doi-asserted-by":"publisher","unstructured":"Kocman R, Meduna A (2016) On parallel versions of jumping finite automata. In: Janech J, Kostolny J, Gratkowski T (eds) Advances in Intelligent Systems and Computing, Springer, Berlin, pp.\u00a0142\u2013149. https:\/\/doi.org\/10.1007\/978-3-319-46535-7_12","DOI":"10.1007\/978-3-319-46535-7_12"},{"issue":"6","key":"9844_CR13","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1142\/S0129054115500409","volume":"26","author":"Z Krivka","year":"2015","unstructured":"Krivka Z, Meduna A (2015) Jumping grammars. Int J Found Comput Sci 26(6):709\u2013732. https:\/\/doi.org\/10.1142\/S0129054115500409","journal-title":"Int J Found Comput Sci"},{"issue":"3","key":"9844_CR14","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-0000(79)90039-4","volume":"18","author":"M Latteux","year":"1979","unstructured":"Latteux M (1979) C\u00f4nes rationnels commutatifs. J Comput Syst Sci 18(3):307\u2013333. https:\/\/doi.org\/10.1016\/0022-0000(79)90039-4","journal-title":"J Comput Syst Sci"},{"key":"9844_CR15","unstructured":"Madejski G (2016) 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"},{"issue":"7","key":"9844_CR16","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1142\/S0129054112500244","volume":"23","author":"A Meduna","year":"2012","unstructured":"Meduna A, Zemek P (2012) Jumping finite automata. Int J Found Comput Sci 23(7):1555\u20131578. https:\/\/doi.org\/10.1142\/S0129054112500244","journal-title":"Int J Found Comput Sci"},{"key":"9844_CR17","doi-asserted-by":"publisher","unstructured":"Meduna A, Zemek P (2014) Regulated grammars and automata. Springer. https:\/\/doi.org\/10.1007\/978-1-4939-0369-6","DOI":"10.1007\/978-1-4939-0369-6"},{"issue":"4","key":"9844_CR18","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh R (1966) On context-free languages. J. ACM 13(4):570\u2013581. https:\/\/doi.org\/10.1145\/321356.321364","journal-title":"J. ACM"},{"key":"9844_CR19","unstructured":"Sipser M (2006) Introduction to the Theory of Computation, second edn. Course Technology"},{"issue":"1","key":"9844_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(89)90108-7","volume":"31","author":"S Yu","year":"1989","unstructured":"Yu S (1989) A pumping lemma for deterministic context-free languages. Inf Process Lett 31(1):47\u201351. https:\/\/doi.org\/10.1016\/0020-0190(89)90108-7","journal-title":"Inf Process Lett"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-021-09844-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-021-09844-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-021-09844-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T10:28:07Z","timestamp":1647426487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-021-09844-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,9]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["9844"],"URL":"https:\/\/doi.org\/10.1007\/s11047-021-09844-4","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,9]]},"assertion":[{"value":"16 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}