{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:08:04Z","timestamp":1767229684744,"version":"3.48.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_11","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"125-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["State Complexity of\u00a0Union and\u00a0Intersection on\u00a0Graph-Walking Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1249-5173","authenticated-orcid":false,"given":"Olga","family":"Martynova","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Birget, J.-C.: Partial orders on words, minimal elements of regular languages, and state complexity. Theor. Comput. Sci. 119, 267\u2013291 (1993). http:\/\/dx.doi.org\/10.1016\/0304-3975(93)90160-U","DOI":"10.1016\/0304-3975(93)90160-U"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/050645427","volume":"38","author":"M Boja\u0144czyk","year":"2008","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. SIAM J. Comput. 38(2), 658\u2013701 (2008). https:\/\/doi.org\/10.1137\/050645427","journal-title":"SIAM J. Comput."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Budach, L.: Automata and labyrinths. Mathematische Nachrichten 86(1), 195\u2013282 (1978). http:\/\/dx.doi.org\/10.1002\/mana.19780860120","DOI":"10.1002\/mana.19780860120"},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Disser, Y., Hackfeld, J., Klimm, M.: Tight bounds for undirected graph exploration with pebbles and multiple agents. J. ACM 66(6), 40:1\u201340:41 (2019). https:\/\/doi.org\/10.1145\/3356883","DOI":"10.1145\/3356883"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theor. Comput. Sci. 345(2\u20133), 331\u2013344 (2005). http:\/\/dx.doi.org\/10.1016\/j.tcs.2005.07.014","DOI":"10.1016\/j.tcs.2005.07.014"},{"issue":"5","key":"11_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00236-020-00373-8","volume":"58","author":"V Geffert","year":"2021","unstructured":"Geffert, V., Kapoutsis, C.A., Zakzok, M.: Complement for two-way alternating automata. Acta Informatica 58(5), 463\u2013495 (2021). https:\/\/doi.org\/10.1007\/s00236-020-00373-8","journal-title":"Acta Informatica"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Inf. Comput. 205(8), 1173\u20131187 (2007). http:\/\/dx.doi.org\/10.1016\/j.ic.2007.01.008","DOI":"10.1016\/j.ic.2007.01.008"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-662-44522-8_25","volume-title":"Mathematical Foundations of Computer Science 2014","author":"V Geffert","year":"2014","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). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_25"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Int. J. Found. Comput. Sci. 14, 1087\u20131102 (2003). http:\/\/dx.doi.org\/10.1142\/S0129054103002199","DOI":"10.1142\/S0129054103002199"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Kunc, M., Okhotin, A.: State complexity of union and intersection for two-way nondeterministic finite automata. Fundamenta Informaticae  110(1\u20134), 231\u2013239 (2011). http:\/\/dx.doi.org\/10.3233\/FI-2011-540","DOI":"10.3233\/FI-2011-540"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Kunc, M., Okhotin, A.: Reversibility of computations in graph-walking automata. Inf. Comput. 275, Article No. 104631 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104631","DOI":"10.1016\/j.ic.2020.104631"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Martynova, O., Okhotin, A.: Lower bounds for graph-walking automata. In: 38th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2021, Saarbr\u00fccken, Germany, 16\u201319 March 2021), LIPIcs, vol. 187, pp. 52:1\u201352:13 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.52","DOI":"10.4230\/LIPIcs.STACS.2021.52"},{"key":"11_CR13","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Sov. Math. Dokl. 11, 1373\u20131375 (1970)","journal-title":"Sov. Math. Dokl."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Muscholl, A., Samuelides, M., Segoufin, L.: Complementing deterministic tree-walking automata. Inf. Proces. Lett. 99(1), 33\u201339 (2006). http:\/\/dx.doi.org\/10.1016\/j.ipl.2005.09.017","DOI":"10.1016\/j.ipl.2005.09.017"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-030-23679-3_2","volume-title":"Implementation and Application of Automata","author":"A Okhotin","year":"2019","unstructured":"Okhotin, A.: Graph-Walking automata: from whence they come, and whither they are bound. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 10\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23679-3_2"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Piao, X., Salomaa, K.: Operational state complexity of nested word automata. Theor. Comput. Sci. 410, 3290\u20133302 (2009). http:\/\/dx.doi.org\/10.1016\/j.tcs.2009.05.002","DOI":"10.1016\/j.tcs.2009.05.002"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Halting space-bounded computations. Theor. Comput. Sci. 10(3), 335\u2013338 (1980). http:\/\/dx.doi.org\/10.1016\/0304-3975(80)90053-5","DOI":"10.1016\/0304-3975(80)90053-5"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93489-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:03:11Z","timestamp":1767229391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}