{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T04:05:22Z","timestamp":1779509122285,"version":"3.53.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032026019","type":"print"},{"value":"9783032026026","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:00:00Z","timestamp":1755907200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-02602-6_13","type":"book-chapter","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T08:33:44Z","timestamp":1755851624000},"page":"180-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simulating Two-Way Nondeterministic Finite Automata Over\u00a0Small Alphabets by\u00a0One-Way Nondeterministic Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9143-1479","authenticated-orcid":false,"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,23]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Berman, P.: A note on sweeping automata. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 91\u201397. Springer, Heidelberg (1980)","DOI":"10.1007\/3-540-10003-2_62"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Birget, J.-C.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43, 185\u2013190 (1992)","DOI":"10.1016\/0020-0190(92)90198-5"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Chrobak, M.: Finite automata and unary languages. Theor. Comput. Sci. 47, 149\u2013158 (1986)","DOI":"10.1016\/0304-3975(86)90142-8"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295(1\u20133), 189\u2013203 (2003)","DOI":"10.1016\/S0304-3975(02)00403-6"},{"key":"13_CR5","unstructured":"Geffert, V., Okhotin, A.: One-way simulation of two-way finite automata over small alphabets. In: NCMA 2013, Ume\u00e5, Sweden, 13\u201314 August 2013"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Geffert, V., Okhotin, A.: Transforming two-way alternating finite automata to one-way nondeterministic automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 291\u2013302. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-662-44522-8_25"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Geffert, V., Okhotin, A.: Deterministic one-way simulation of two-way deterministic finite automata over small alphabets. Int. J. Found. Comput. Sci. (2025, to appear)","DOI":"10.1142\/S0129054124420024"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Geffert, V., Pighizzini, G.: Two-way unary automata versus logarithmic space. Inf. Comput. 209(7), 1016\u20131025 (2011)","DOI":"10.1016\/j.ic.2011.03.003"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Glaister, I., Shallit, J.: A lower bound technique for the size of nondeterministic finite automata. Inf. Process. Lett. 59, 75\u201377 (1996)","DOI":"10.1016\/0020-0190(96)00095-6"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C.A.: Removing bidirectionality from nondeterministic finite automata. In: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005)","DOI":"10.1007\/11549345_47"},{"key":"13_CR11","unstructured":"Kapoutsis, C.A.: Algorithms and lower bounds in finite automata size complexity. Ph.D. thesis, Massachusetts Institute of Technology (2006)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C.A.: Two-way automata versus logarithmic space. Theory Comput. Syst. 55(2), 421\u2013447 (2014)","DOI":"10.1007\/s00224-013-9465-0"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Kapoutsis, C.A., Pighizzini, G.: Two-way automata characterizations of L\/poly versus NL. Theor. Comput. Syst. 56(4), 662\u2013685 (2015)","DOI":"10.1007\/s00224-014-9560-x"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Kunc, M., Okhotin, A.: Describing periodicity in two-way deterministic finite automata using transformation semigroups. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 324\u2013336. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22321-1_28"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Mereghetti, C., Pighizzini, G.: Optimal simulations between unary automata. SIAM J. Comput. 30(6), 1976\u20131992 (2001)","DOI":"10.1137\/S009753979935431X"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S.: Two-way deterministic finite automata are exponentially more succinct than sweeping automata. Inf. Process. Lett. 12(2), 103\u2013105 (1981)","DOI":"10.1016\/0020-0190(81)90012-0"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Moore, F.R.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. 20, 1211\u20131214 (1971)","DOI":"10.1109\/T-C.1971.223108"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Petrov, S., Okhotin, A.: On the transformation of two-way finite automata to unambiguous finite automata. Inf. Comput. 295A (2023). Article 104956","DOI":"10.1016\/j.ic.2022.104956"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Petrov, S., Okhotin, A.: On the transformation of two-way nondeterministic finite automata to unambiguous finite automata. In: Ko, S., Manea, F. (eds.) DLT 2025. LNCS, vol. 16036 (2025)","DOI":"10.1007\/978-3-032-01475-7_8"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114\u2013125 (1959)","DOI":"10.1147\/rd.32.0114"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 275\u2013286 (1978)","DOI":"10.1145\/800133.804357"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Shepherdson, J.C.: The reduction of two-way automata to one-way automata. IBM J. Res. Dev. 3, 198\u2013200 (1959)","DOI":"10.1147\/rd.32.0198"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Vardi, M.: A note on the reduction of two-way automata to one-way automata. Inf. Process. Lett. 30(5), 261\u2013264 (1989)","DOI":"10.1016\/0020-0190(89)90205-6"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02602-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T03:24:03Z","timestamp":1779506643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02602-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,23]]},"ISBN":["9783032026019","9783032026026"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02602-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,23]]},"assertion":[{"value":"23 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2025.unipa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}