{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T16:57:14Z","timestamp":1771952234560,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031332630","type":"print"},{"value":"9783031332647","type":"electronic"}],"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-33264-7_15","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"182-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tree-Walking-Storage Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-2625","authenticated-orcid":false,"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0216-8803","authenticated-orcid":false,"given":"Uwe","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"15_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. Inform. Control 19, 439\u2013475 (1971)","journal-title":"Inform. Control"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1142\/S0129054117400081","volume":"28","author":"S Bensch","year":"2017","unstructured":"Bensch, S., Bj\u00f6rklund, J., Kutrib, M.: Deterministic stack transducers. Int. J. Found. Comput. Sci. 28, 583\u2013601 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR3","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, 164\u2013173 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR4","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, 658\u2013701 (2008)","journal-title":"SIAM J. Comput."},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-662-53132-7_12","volume-title":"Developments in Language Theory","author":"T Denkinger","year":"2016","unstructured":"Denkinger, T.: An automata characterisation for multiple context-free languages. In: Brlek, S., Reutenauer, C. (eds.) DLT 2016. LNCS, vol. 9840, pp. 138\u2013150. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53132-7_12"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/321371.321385","volume":"14","author":"S Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: Stack automata and compiling. J. ACM 14, 172\u2013201 (1967)","journal-title":"J. ACM"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S Ginsburg","year":"1967","unstructured":"Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14, 389\u2013418 (1967)","journal-title":"J. ACM"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF01201277","volume":"29","author":"W Golubski","year":"1996","unstructured":"Golubski, W., Lippe, W.: Tree-stack automata. Math. Syst. Theory 29, 227\u2013244 (1996)","journal-title":"Math. Syst. Theory"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","volume":"3","author":"SA Greibach","year":"1969","unstructured":"Greibach, S.A.: Checking automata and one-way stack languages. J. Comput. Syst. Sci. 3, 196\u2013217 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown tree automata. Math. Syst. Theory 16, 237\u2013263 (1983)","journal-title":"Math. Syst. Theory"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01786980","volume":"15","author":"EM Gurari","year":"1982","unstructured":"Gurari, E.M., Ibarra, O.H.: (Semi)alternating stack automata. Math. Syst. Theory 15, 211\u2013224 (1982)","journal-title":"Math. Syst. Theory"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/S0022-0000(67)80013-8","volume":"1","author":"JE Hopcroft","year":"1967","unstructured":"Hopcroft, J.E., Ullman, J.D.: Nonerasing stack automata. J. Comput. Syst. Sci. 1, 166\u2013186 (1967)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0022-0000(68)80003-0","volume":"2","author":"JE Hopcroft","year":"1968","unstructured":"Hopcroft, J.E., Ullman, J.D.: Deterministic stack automata and the quotient operator. J. Comput. Syst. Sci. 2, 1\u201312 (1968)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0019-9958(68)90722-5","volume":"13","author":"JE Hopcroft","year":"1968","unstructured":"Hopcroft, J.E., Ullman, J.D.: Sets accepted by one-way stack automata are context sensitive. Inform. Control 13, 114\u2013133 (1968)","journal-title":"Inform. Control"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/S0022-0000(71)80029-6","volume":"5","author":"OH Ibarra","year":"1971","unstructured":"Ibarra, O.H.: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. J. Comput. Syst. Sci. 5, 88\u2013117 (1971)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1142\/S0129054121420090","volume":"32","author":"OH Ibarra","year":"2021","unstructured":"Ibarra, O.H., Jir\u00e1sek, J., McQuillan, I., Prigioniero, L.: Space complexity of stack automata models. Int. J. Found. Comput. Sci. 32, 801\u2013823 (2021)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.04.024","volume":"738","author":"OH Ibarra","year":"2018","unstructured":"Ibarra, O.H., McQuillan, I.: Variations of checking stack automata: obtaining unexpected decidability properties. Theor. Comput. Sci. 738, 1\u201312 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.04.024","journal-title":"Theor. Comput. Sci."},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1142\/S0129054121410045","volume":"32","author":"OH Ibarra","year":"2021","unstructured":"Ibarra, O.H., McQuillan, I.: Generalizations of checking stack automata: characterizations and hierarchies. Int. J. Found. Comput. Sci. 32, 481\u2013508 (2021)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/S0022-0000(74)80005-X","volume":"9","author":"SR Kosaraju","year":"1974","unstructured":"Kosaraju, S.R.: 1-way stack automaton with jumps. J. Comput. Syst. Sci. 9, 164\u2013176 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR20","first-page":"59","volume":"155","author":"M Kutrib","year":"2017","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Tinput-driven pushdown, counter, and stack automata. Fund. Inform. 155, 59\u201388 (2017)","journal-title":"Fund. Inform."},{"key":"15_CR21","first-page":"795","volume":"16","author":"K Lange","year":"2010","unstructured":"Lange, K.: A note on the P-completeness of deterministic one-way stack language. J. UCS 16, 795\u2013799 (2010)","journal-title":"J. UCS"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Ogden, W.F.: Intercalation theorems for stack languages. In: Proceedings of the First Annual ACM Symposium on Theory of Computing (STOC 1969), pp. 31\u201342. ACM Press, New York (1969)","DOI":"10.1145\/800169.805419"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-662-21545-6_3","volume-title":"Automata, Languages and Programming","author":"E Shamir","year":"1974","unstructured":"Shamir, E., Beeri, C.: Checking stacks and context-free programmed grammars accept p-complete languages. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14, pp. 27\u201333. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/978-3-662-21545-6_3"},{"key":"15_CR24","volume-title":"Computational Complexity","author":"K Wagner","year":"1986","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:06:07Z","timestamp":1684397167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","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":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"19","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":"59% - 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":"6","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)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}