{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T10:23:20Z","timestamp":1780050200602,"version":"3.53.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031770180","type":"print"},{"value":"9783031770197","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77019-7_4","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:46:52Z","timestamp":1732222012000},"page":"62-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Jump Complexity of Deterministic Finite Automata with Translucent Letters"],"prefix":"10.1007","author":[{"given":"Szil\u00e1rd","family":"Zsolt Fazekas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Mitrana","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrei","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihaela","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2020.100605","volume":"117","author":"F Arroyo","year":"2020","unstructured":"Arroyo, F., Mitrana, V., P\u0103un, A., P\u0103un, M., S\u00e1nchez-Couso, J.: On the group memory complexity of extended finite automata over groups. J. Log. Algebraic Methods Program. 117, 100605 (2020). https:\/\/doi.org\/10.1016\/j.jlamp.2020.100605","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"11","key":"4_CR2","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.ic.2009.03.002","volume":"207","author":"S Bensch","year":"2009","unstructured":"Bensch, S., Bordihn, H., Holzer, M., Kutrib, M.: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11), 1140\u20131155 (2009). https:\/\/doi.org\/10.1016\/j.ic.2009.03.002","journal-title":"Inf. Comput."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.jcss.2019.08.001","volume":"108","author":"H Bordihn","year":"2020","unstructured":"Bordihn, H., Mitrana, V.: On the degrees of non-regularity and non-context-freeness. J. Comput. Syst. Sci. 108, 104\u2013117 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2019.08.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1142\/S0129054116500211","volume":"27","author":"H Chigahara","year":"2016","unstructured":"Chigahara, H., Fazekas, S., Yamamura, A.: One-way jumping finite automata. Int. J. Found. Comput. Sci. 27(3), 391\u2013405 (2016). https:\/\/doi.org\/10.1142\/S0129054116500211","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Fazekas, S., Mercas, R.: Sweep complexity revisited. In: Implementation and Application of Automata - 27th International Conference, CIAA 2023. Lecture Notes in Computer Science, vol. 14151, pp. 116\u2013127. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-26501-1_11","DOI":"10.1007\/978-3-031-26501-1_11"},{"issue":"1\u20133","key":"4_CR6","first-page":"131","volume":"27","author":"S Fazekas","year":"2022","unstructured":"Fazekas, S., Mercas, R., Wu, O.: Complexities for jumps and sweeps. J. Autom. Lang. Comb. 27(1\u20133), 131\u2013149 (2022)","journal-title":"J. Autom. Lang. Comb."},{"key":"4_CR7","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). https:\/\/doi.org\/10.1016\/j.tcs.2021.02.030","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"4_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962). https:\/\/doi.org\/10.1145\/367766.368168","journal-title":"Commun. ACM"},{"issue":"7","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1142\/S012905411250039X","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\/S012905411250039X","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114450","volume":"992","author":"V Mitrana","year":"2024","unstructured":"Mitrana, V., P\u0103un, A., P\u0103un, M., S\u00e1nchez-Couso, J.: Jump complexity of finite automata with translucent letters. Theor. Comput. Sci. 992, 114450 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114450","journal-title":"Theor. Comput. Sci."},{"key":"4_CR11","unstructured":"Nagy, B., Otto, F.: Finite state acceptors with translucent letters. In: Proceedings of of the First International Workshop on AI Methods for Interdisciplinary Research in Language and Biology (BILC-2011), pp. 3\u201313. SCITEPRESS (2011)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-031-40247-0_2","volume-title":"Implementation and Application of Automata","author":"F Otto","year":"2023","unstructured":"Otto, F.: A survey on automata with translucent letters. In: Nagy, B. (ed.) Implementation and Application of Automata, pp. 21\u201350. Springer Nature Switzerland, Cham (2023)"},{"key":"4_CR13","volume-title":"Handbook of Formal Languages","year":"1997","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer-Verlag, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:29:38Z","timestamp":1732224578000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}