{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:31:20Z","timestamp":1743154280045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031074684"},{"type":"electronic","value":"9783031074691"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07469-1_14","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T14:20:31Z","timestamp":1653661231000},"page":"177-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Homomorphisms 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,5,28]]},"reference":[{"issue":"2\u20133","key":"14_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.tcs.2005.10.031","volume":"350","author":"M Bojanczyk","year":"2006","unstructured":"Bojanczyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350(2\u20133), 164\u2013173 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/050645427","volume":"38","author":"M Bojanczyk","year":"2008","unstructured":"Bojanczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. SIAM J. Comput. 38(2), 658\u2013701 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/mana.19780860120","volume":"86","author":"L Budach","year":"1978","unstructured":"Budach, L.: Automata and labyrinths. Mathematische Nachrichten 86(1), 195\u2013282 (1978)","journal-title":"Mathematische Nachrichten"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(82)90072-5","volume":"4","author":"K Cul\u00edk II","year":"1982","unstructured":"Cul\u00edk, K., II., Fich, F.E., Salomaa, A.: A homomorphic characterization of regular languages. Discret. Appl. Math. 4(2), 149\u2013152 (1982)","journal-title":"Discret. Appl. Math."},{"key":"14_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3356883"},{"issue":"2\u20133","key":"14_CR6","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P Fraigniaud","year":"2005","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)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0304-3975(02)00403-6","volume":"295","author":"V Geffert","year":"2003","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295, 189\u2013203 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Geffert, V., Okhotin, A.: Deterministic one-way simulation of two-way deterministic finite automata over small alphabets. In: Han, Y., Ko, S. (eds.) Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, 5 September 2021, Proceedings. LNCS, vol. 13037, pp. 26\u201337. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93489-7_3","DOI":"10.1007\/978-3-030-93489-7_3"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ic.2016.12.007","volume":"253","author":"G Jir\u00e1skov\u00e1","year":"2017","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: On the state complexity of operations on two-way finite automata. Inf. Comput. 253, 36\u201363 (2017)","journal-title":"Inf. Comput."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/11549345_47","volume-title":"Mathematical Foundations of Computer Science 2005","author":"C Kapoutsis","year":"2005","unstructured":"Kapoutsis, C.: Removing bidirectionality from nondeterministic finite automata. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11549345_47"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/s00224-014-9560-x","volume":"56","author":"CA Kapoutsis","year":"2015","unstructured":"Kapoutsis, C.A., Pighizzini, G.: Two-way automata characterizations of l\/poly versus NL. Theory Comput. Syst. 56(4), 662\u2013685 (2015)","journal-title":"Theory Comput. Syst."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-22321-1_28","volume-title":"Developments in Language Theory","author":"M Kunc","year":"2011","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). https:\/\/doi.org\/10.1007\/978-3-642-22321-1_28"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.tcs.2012.04.010","volume":"449","author":"M Kunc","year":"2012","unstructured":"Kunc, M., Okhotin, A.: State complexity of operations on two-way finite automata over a unary alphabet. Theor. Comput. Sci. 449, 106\u2013118 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104631","volume":"275","author":"M Kunc","year":"2020","unstructured":"Kunc, M., Okhotin, A.: Reversibility of computations in graph-walking automata. Inf. Comput. 275, 104631 (2020)","journal-title":"Inf. Comput."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/BFb0036926","volume-title":"Automata, Languages and Programming","author":"M Latteux","year":"1983","unstructured":"Latteux, M., Leguy, J.: On the composition of morphisms and inverse morphisms. In: Diaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 420\u2013432. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/BFb0036926"},{"key":"14_CR16","unstructured":"Martynova, O., Okhotin, A.: Lower bounds for graph-walking automata. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16\u20131, March 2021, Saarbr\u00fccken, Germany (Virtual Conference). LIPIcs, vol. 187, pp. 52:1\u201352:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Martynova, O., Okhotin, A.: State complexity of union and intersection on graph-walking automata. In: Han, Y., Ko, S. (eds.) Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings. LNCS, vol. 13037, pp. 125\u2013136. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-93489-7_11","DOI":"10.1007\/978-3-030-93489-7_11"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-030-68195-1_7","volume-title":"Language and Automata Theory and Applications","author":"S Petrov","year":"2021","unstructured":"Petrov, S., Okhotin, A.: On the transformation of two-way deterministic finite automata to unambiguous finite automata. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2021. LNCS, vol. 12638, pp. 81\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68195-1_7"}],"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-031-07469-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T23:06:13Z","timestamp":1655766373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07469-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031074684","9783031074691"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07469-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 May 2022","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":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa2022.sciencesconf.org\/","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":"26","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":"16","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":"3","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":"62% - 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":"2.8","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)"}}]}}