{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:10Z","timestamp":1742913190365,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_2","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"9-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Jumping Automata over\u00a0Infinite Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9021-1175","authenticated-orcid":false,"given":"Shaull","family":"Almagor","sequence":"first","affiliation":[]},{"given":"Omer","family":"Yizhaq","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abu Nassar, A., Almagor, S.: Simulation by rounds of letter-to-letter transducers. In: 30th EACSL Annual Conference on Computer Science Logic (2022)","DOI":"10.46298\/lmcs-19(4:19)2023"},{"key":"2_CR2","unstructured":"Almagor, S.: Process symmetry in probabilistic transducers. In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2020)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Beier, S., Holzer, M., Kutrib, M.: On the descriptional complexity of operations on semilinear sets. In: EPTCS, vol. 252, p. 41 (2017)","DOI":"10.4204\/EPTCS.252.8"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcchi, J.R.: Symposium on decision problems: on a decision method in restricted second order arithmetic. In: Studies in Logic and the Foundations of Mathematics, vol. 44, pp. 1\u201311. Elsevier (1966)","DOI":"10.1016\/S0049-237X(09)70564-6"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita\/2012013","volume":"46","author":"M Cadilhac","year":"2012","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: Affine Parikh automata. RAIRO-Theor. Inform. Appl. 46(4), 511\u2013545 (2012)","journal-title":"RAIRO-Theor. Inform. Appl."},{"issue":"08","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1142\/S0129054112400709","volume":"23","author":"M Cadilhac","year":"2012","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: Bounded Parikh automata. Int. J. Found. Comput. Sci. 23(08), 1691\u20131709 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR7","unstructured":"Chistikov, D., Haase, C.: The taming of the semi-linear set. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Lei, C.L.: Modalities for model checking (extended abstract) branching time strikes back. In: Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 84\u201396 (1985)","DOI":"10.1145\/318593.318620"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.tcs.2021.02.030","volume":"864","author":"SZ Fazekas","year":"2021","unstructured":"Fazekas, S.Z., Hoshi, K., Yamamura, A.: Two-way deterministic automata with jumping mode. Theor. Comput. Sci. 864, 92\u2013102 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR10","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":"2_CR11","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)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR12","unstructured":"Guha, S., Jecker, I., Lehtinen, K., Zimmermann, M.: Parikh automata over infinite words. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2022)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 681\u2013696. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_54"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Kopczynski, E., To, A.W.: Parikh images of grammars: complexity and applications. In: 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp. 80\u201389. IEEE (2010)","DOI":"10.1109\/LICS.2010.21"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-319-10575-8_4","volume-title":"Handbook of Model Checking","author":"O Kupferman","year":"2018","unstructured":"Kupferman, O.: Automata theory and model checking. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 107\u2013151. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_4"},{"key":"2_CR16","unstructured":"Landweber, L.H.: Decision problems for w-automata. Technical report, University of Wisconsin-Madison, Department of Computer Sciences (1968)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-319-09704-6_26","volume-title":"Descriptional Complexity of Formal Systems","author":"GJ Lavado","year":"2014","unstructured":"Lavado, G.J., Pighizzini, G., Seki, S.: Operational state complexity under Parikh equivalence. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 294\u2013305. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09704-6_26"},{"issue":"5","key":"2_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inf. Control 9(5), 521\u2013530 (1966)","journal-title":"Inf. Control"},{"issue":"07","key":"2_CR19","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(07), 1555\u20131578 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM (JACM) 13(4), 570\u2013581 (1966)","journal-title":"J. ACM (JACM)"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of $$\\omega $$-automata. In: Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pp. 319\u2013327 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"2_CR22","unstructured":"To, A.W.: Parikh images of regular languages: complexity and applications. arXiv preprint arXiv:1002.1464 (2010)"},{"issue":"01","key":"2_CR23","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(01), 1\u201315 (2018)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T07:01:53Z","timestamp":1702450913000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"19","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":"59% - 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":"6","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":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}