{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:33:44Z","timestamp":1743122024754,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030485153"},{"type":"electronic","value":"9783030485160"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48516-0_11","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T23:04:30Z","timestamp":1590447870000},"page":"137-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Space Complexity of Stack Automata Models"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Jozef","family":"Jir\u00e1sek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"McQuillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7163-4965","authenticated-orcid":false,"given":"Luca","family":"Prigioniero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"05","key":"11_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(05), 583\u2013601 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0890-5401(89)90015-1","volume":"80","author":"J Engelfriet","year":"1989","unstructured":"Engelfriet, J.: The power of two-way deterministic checking stack automata. Inf. Comput. 80(2), 114\u2013120 (1989)","journal-title":"Inf. Comput."},{"issue":"2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0022-0000(69)80012-7","volume":"3","author":"S Greibach","year":"1969","unstructured":"Greibach, S.: Checking automata and one-way stack languages. J. Comput. Syst. Sci. 3(2), 196\u2013217 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR5","series-title":"Addison-Wesley Series in Computer Science","volume-title":"Introduction to Formal Language Theory","author":"MA Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley Series in Computer Science. Addison-Wesley Pub. Co., Boston (1978)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Context-free languages and Turing machine computations. In: Mathematical Aspects of Computer Science. Proceedings of Symposia in Applied Mathematics, vol. 19, pp. 42\u201351. American Mathematical Society (1967)","DOI":"10.1090\/psapm\/019\/0235938"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/214037.214040","volume":"27","author":"J Hartmanis","year":"1995","unstructured":"Hartmanis, J.: Turing award lecture: on computational complexity and the nature of computer science. ACM Comput. Surv. 27(1), 7\u201316 (1995). \nhttps:\/\/doi.org\/10.1145\/214037.214040","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0019-9958(68)90722-5","volume":"13","author":"J Hopcroft","year":"1968","unstructured":"Hopcroft, J., Ullman, J.: Sets accepted by one-way stack automata are context sensitive. Inf. Control 13(2), 114\u2013133 (1968)","journal-title":"Inf. Control"},{"key":"11_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation Reading","author":"J Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation Reading. Addison-Wesley, Boston (1979)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-319-98654-8_34","volume-title":"Developments in Language Theory","author":"OH Ibarra","year":"2018","unstructured":"Ibarra, O.H., McQuillan, I.: Generalizations of checking stack automata: characterizations and hierarchies. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 416\u2013428. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-98654-8_34"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.tcs.2018.05.036","volume":"745","author":"OH Ibarra","year":"2018","unstructured":"Ibarra, O.H., McQuillan, I.: On store languages of languages acceptors. Theor. Comput. Sci. 745, 114\u2013132 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0022-0000(78)90010-7","volume":"17","author":"K King","year":"1978","unstructured":"King, K., Wrathall, C.: Stack languages and $$\\log n$$ space. J. Comput. Syst. Sci. 17(3), 281\u2013299 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR13","first-page":"107","volume":"14","author":"G Pighizzini","year":"2009","unstructured":"Pighizzini, G.: Nondeterministic one-tape off-line Turing machines and their time complexity. J. Autom. Lang. Comb. 14, 107\u2013124 (2009)","journal-title":"J. Autom. Lang. Comb."},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-23247-4_20","volume-title":"Descriptional Complexity of Formal Systems","author":"G Pighizzini","year":"2019","unstructured":"Pighizzini, G., Prigioniero, L.: Pushdown automata and constant height: decidability and bounds. In: Hospod\u00e1r, M., Jir\u00e1skov\u00e1, G., Konstantinidis, S. (eds.) DCFS 2019. LNCS, vol. 11612, pp. 260\u2013271. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-23247-4_20"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48516-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:03:19Z","timestamp":1590451399000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48516-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030485153","9783030485160"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48516-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 May 2020","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":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","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":"dlt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/knot.math.usf.edu\/dlt2020\/","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":"38","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":"24","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":"63% - 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.7","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":"1.48","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":"Conference cancelled due to the COVID-19 pandemic","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}