{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:49Z","timestamp":1759638829019,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209803"},{"type":"electronic","value":"9783030209810"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20981-0_5","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"62-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Enhancement of Automata with Jumping Modes"],"prefix":"10.1007","author":[{"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":[[2019,5,14]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-98654-8_9","volume-title":"Developments in Language Theory","author":"S Beier","year":"2018","unstructured":"Beier, S., Holzer, M.: Decidability of right one-way jumping finite automata. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 109\u2013120. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_9"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-319-94631-3_2","volume-title":"Descriptional Complexity of Formal Systems","author":"S Beier","year":"2018","unstructured":"Beier, S., Holzer, M.: Properties of right one-way jumping finite automata. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 11\u201323. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94631-3_2"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-319-62809-7_6","volume-title":"Developments in Language Theory","author":"S Beier","year":"2017","unstructured":"Beier, S., Holzer, M., Kutrib, M.: Operational state complexity and decidability of jumping finite automata. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 96\u2013108. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_6"},{"issue":"3","key":"5_CR4","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(3), 391\u2013405 (2016). https:\/\/doi.org\/10.1142\/S0129054116400165","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-22360-5_8","volume-title":"Implementation and Application of Automata","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L.: Jumping finite automata: characterizations and complexity. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 89\u2013101. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22360-5_8"},{"key":"5_CR6","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":"5_CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"5_CR8","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-46535-7_12","volume-title":"Proceedings of the 2015 Federated Conference on Software Development and Object Technologies","author":"R Kocman","year":"2017","unstructured":"Kocman, R., Meduna, A.: On parallel versions of jumping finite automata. In: Janech, J., Kostolny, J., Gratkowski, T. (eds.) SDOT 2015. AISC, vol. 511, pp. 142\u2013149. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-46535-7_12"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1142\/S0129054115500409","volume":"26","author":"Z Krivka","year":"2015","unstructured":"Krivka, Z., Meduna, A.: Jumping grammars. Int. J. Found. Comput. Sci. 26(6), 709\u2013732 (2015). https:\/\/doi.org\/10.1142\/S0129054115500409","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"5_CR10","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.: C\u00f4nes rationnels commutatifs. J. Comput. Syst. Sci. 18(3), 307\u2013333 (1979). https:\/\/doi.org\/10.1016\/0022-0000(79)90039-4","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR11","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)"},{"issue":"7","key":"5_CR12","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":"5_CR13","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, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4939-0369-6"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966). https:\/\/doi.org\/10.1145\/321356.321364","journal-title":"J. ACM"},{"key":"5_CR15","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"2006","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Course Technology, Boston (2006)","edition":"2"},{"issue":"1","key":"5_CR16","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.: A pumping lemma for deterministic context-free languages. Inf. Process. Lett. 31(1), 47\u201351 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90108-7","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20981-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:02:25Z","timestamp":1687132945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20981-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209803","9783030209810"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20981-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guadalajara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/automata2019.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}