{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:33:55Z","timestamp":1774798435544,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030236786","type":"print"},{"value":"9783030236793","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23679-3_2","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:02:38Z","timestamp":1562526158000},"page":"10-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Graph-Walking Automata: From Whence They Come, and Whither They are Bound"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"issue":"5","key":"2_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","volume":"19","author":"AV Aho","year":"1971","unstructured":"Aho, A.V., Ullman, J.D.: Translations on a context free grammar. Inf. Control 19(5), 439\u2013475 (1971)","journal-title":"Inf. Control"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1137\/S009753979732428X","volume":"29","author":"S Albers","year":"2000","unstructured":"Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164\u20131188 (2000). \n                      https:\/\/doi.org\/10.1137\/S009753979732428X","journal-title":"SIAM J. Comput."},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of 20th Annual Symposium on Foundations of Computer Science, FOCS 1979, pp. 218\u2013223. IEEE Computer Society (1979). \n                      https:\/\/doi.org\/10.1109\/SFCS.1979.34","DOI":"10.1109\/SFCS.1979.34"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-319-13075-0_44","volume-title":"Algorithms and Computation","author":"T Asano","year":"2014","unstructured":"Asano, T., et al.: Depth-first search using \n                      \n                        \n                      \n                      $$O(n)$$\n                     bits. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 553\u2013564. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-13075-0_44"},{"issue":"12","key":"2_CR5","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/BF02084158","volume":"21","author":"CH Bennett","year":"1982","unstructured":"Bennett, C.H.: The thermodynamics of computation\u2013a review. Int. J. Theor. Phys. 21(12), 905\u2013940 (1982). \n                      https:\/\/doi.org\/10.1007\/BF02084158","journal-title":"Int. J. Theor. Phys."},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: Proceedings of 19th Annual Symposium on Foundations of Computer Science, FOCS 1978, pp. 132\u2013142. IEEE Computer Society (1978). \n                      https:\/\/doi.org\/10.1109\/SFCS.1978.30","DOI":"10.1109\/SFCS.1978.30"},{"issue":"2\u20133","key":"2_CR7","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.tcs.2005.10.031","volume":"350","author":"M Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350(2\u20133), 164\u2013173 (2006). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2005.10.031","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"2_CR8","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). \n                      https:\/\/doi.org\/10.1137\/050645427","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR9","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. Math. Nachr. 86(1), 195\u2013282 (1978). \n                      https:\/\/doi.org\/10.1002\/mana.19780860120","journal-title":"Math. Nachr."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Disser, Y., Hackfeld, J., Klimm, M.: Undirected graph exploration with \n                      \n                        \n                      \n                      $$O(\\log \\log n)$$\n                     pebbles. In: Krauthgamer, R. (ed.) Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 25\u201339. SIAM (2016). \n                      https:\/\/doi.org\/10.1137\/1.9781611974331.ch3","DOI":"10.1137\/1.9781611974331.ch3"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Elmasry, A., Hagerup, T., Kammer, F.: Space-efficient basic graph algorithms. In: Mayr, E.W., Ollinger, N. (eds.) Proceedings of 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015. LIPIcs, vol. 30, pp. 288\u2013301. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2015.288","DOI":"10.4230\/LIPIcs.STACS.2015.288"},{"issue":"2\u20133","key":"2_CR12","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. Theoret. Comput. Sci. 345(2\u20133), 331\u2013344 (2005). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2005.07.014","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR13","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. Theoret. Comput. Sci. 295, 189\u2013203 (2003). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(02)00403-6","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1016\/j.ic.2007.01.008","volume":"205","author":"V Geffert","year":"2007","unstructured":"Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Inf. Comput. 205(8), 1173\u20131187 (2007). \n                      https:\/\/doi.org\/10.1016\/j.ic.2007.01.008","journal-title":"Inf. Comput."},{"key":"2_CR15","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: J\u0229drzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 544\u2013555. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11549345_47"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s00224-013-9465-0","volume":"55","author":"CA Kapoutsis","year":"2014","unstructured":"Kapoutsis, C.A.: Two-way automata versus logarithmic space. Theory Comput. Syst. 55(2), 421\u2013447 (2014). \n                      https:\/\/doi.org\/10.1007\/s00224-013-9465-0","journal-title":"Theory Comput. Syst."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 66\u201375. IEEE Computer Society (1997). \n                      https:\/\/doi.org\/10.1109\/SFCS.1997.646094","DOI":"10.1109\/SFCS.1997.646094"},{"key":"2_CR18","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22321-1_28"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-40313-2_53","volume-title":"Mathematical Foundations of Computer Science 2013","author":"M Kunc","year":"2013","unstructured":"Kunc, M., Okhotin, A.: Reversibility of computations in graph-walking automata. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 595\u2013606. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-40313-2_53"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961). \n                      https:\/\/doi.org\/10.1147\/rd.53.0183","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jcss.1999.1672","volume":"60","author":"K Lange","year":"2000","unstructured":"Lange, K., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60(2), 354\u2013367 (2000). \n                      https:\/\/doi.org\/10.1006\/jcss.1999.1672","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR22","unstructured":"Martynova, O.: Personal Communication, April 2019"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-642-36315-3_3","volume-title":"Reversible Computation","author":"K Morita","year":"2013","unstructured":"Morita, K.: A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 29\u201343. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36315-3_3"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ipl.2005.09.017","volume":"99","author":"A Muscholl","year":"2006","unstructured":"Muscholl, A., Samuelides, M., Segoufin, L.: Complementing deterministic tree-walking automata. Inf. Process. Lett. 99(1), 33\u201339 (2006). \n                      https:\/\/doi.org\/10.1016\/j.ipl.2005.09.017","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorithms 33(2), 281\u2013295 (1999). \n                      https:\/\/doi.org\/10.1006\/jagm.1999.1043","journal-title":"J. Algorithms"},{"issue":"2","key":"2_CR26","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.S.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959). \n                      https:\/\/doi.org\/10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00288647","volume":"13","author":"H Rollik","year":"1980","unstructured":"Rollik, H.: Automaten in planaren graphen. Acta Inform. 13, 287\u2013298 (1980). \n                      https:\/\/doi.org\/10.1007\/BF00288647","journal-title":"Acta Inform."},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(80)90053-5","volume":"10","author":"M Sipser","year":"1980","unstructured":"Sipser, M.: Halting space-bounded computations. Theoret. Comput. Sci. 10, 335\u2013338 (1980). \n                      https:\/\/doi.org\/10.1016\/0304-3975(80)90053-5","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-54233-7_154","volume-title":"Automata, Languages and Programming","author":"W Thomas","year":"1991","unstructured":"Thomas, W.: On logics, tilings, and automata. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) ICALP 1991. LNCS, vol. 510, pp. 441\u2013454. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3-540-54233-7_154"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23679-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:10:53Z","timestamp":1562526653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23679-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236786","9783030236793"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23679-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 June 2019","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":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/ciaa2019\/","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":"28","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":"17","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":"2","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":"61% - 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":"2.89","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.625","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)"}}]}}