{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:49:52Z","timestamp":1743054592023,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031402463"},{"type":"electronic","value":"9783031402470"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-40247-0_18","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:02:54Z","timestamp":1691568174000},"page":"242-253","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Time to\u00a0Cast Away Stones"],"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":[[2023,8,10]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: 8th Annual Symposium on Switching and Automata Theory, Austin, Texas, USA, 18\u201320 October 1967, pp. 155\u2013160. IEEE Computer Society (1967)","DOI":"10.1109\/FOCS.1967.6"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M., Kozen, D.: On the power of the compass (or, why mazes are easier to search than graphs). In: 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, USA, 16\u201318 October 1978, pp. 132\u2013142. IEEE Computer Society (1978)","DOI":"10.1109\/SFCS.1978.30"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11786986_15","volume-title":"Automata, Languages and Programming","author":"M Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Samuelides, M., Schwentick, T., Segoufin, L.: Expressive power of pebble automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 157\u2013168. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11786986_15"},{"issue":"1","key":"18_CR4","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)","journal-title":"Math. Nachr."},{"key":"18_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"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-60207-8_7","volume-title":"Jewels are Forever","author":"J Engelfriet","year":"1999","unstructured":"Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Karhum\u00e4ki, J., Maurer, H.A., Paun, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 72\u201383. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-60207-8_7"},{"issue":"2\u20133","key":"18_CR7","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."},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1051\/ita\/2011001","volume":"44","author":"V Geffert","year":"2010","unstructured":"Geffert, V., Istonov\u00e1, L.: Translation from classical two-way automata to pebble two-way automata. RAIRO Theor. Inform. Appl. 44(4), 507\u2013523 (2010)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0304-3975(96)00119-3","volume":"169","author":"N Globerman","year":"1996","unstructured":"Globerman, N., Harel, D.: Complexity results for two-way and multi-pebble automata and their logics. Theor. Comput. Sci. 169(2), 161\u2013184 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(91)90208-Y","volume":"38","author":"P Goralcik","year":"1991","unstructured":"Goralcik, P., Goralcikov\u00e1, A., Koubek, V.: Alternation with a pebble. Inf. Process. Lett. 38(1), 7\u201313 (1991)","journal-title":"Inf. Process. Lett."},{"key":"18_CR11","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."},{"issue":"1","key":"18_CR12","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)","journal-title":"Inf. Process. Lett."},{"key":"18_CR13","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 Informatica 13, 287\u2013298 (1980). https:\/\/doi.org\/10.1007\/BF00288647","journal-title":"Acta Informatica"},{"key":"18_CR14","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. Theor. Comput. Sci. 10, 335\u2013338 (1980)","journal-title":"Theor. Comput. Sci."}],"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-40247-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T08:09:45Z","timestamp":1691568585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40247-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031402463","9783031402470"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40247-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","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":"Famagusta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciaa.emu.edu.tr\/en","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","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":"20","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":"0","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":"67% - 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-3","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)"}}]}}