{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T18:19:46Z","timestamp":1769883586130,"version":"3.49.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031221040","type":"print"},{"value":"9783031221057","type":"electronic"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_6","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"61-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nondeterministic Auxiliary Depth-Bounded Storage Automata and\u00a0Semi-Unbounded Fan-In Cascading Circuits"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/321623.321625","volume":"18","author":"SA Cook","year":"1971","unstructured":"Cook, S.A.: Characterizations of pushdown machines in terms of time-bounded computers. J. ACM 18, 4\u201318 (1971)","journal-title":"J. ACM"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-16761-7_59","volume-title":"Automata, Languages and Programming","author":"PW Dymond","year":"1986","unstructured":"Dymond, P.W., Ruzzo, W.L.: Parallel RAMs with owned global memory and deterministic context-free language recognition. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 95\u2013104. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16761-7_59"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-62034-6_57","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"H Fernau","year":"1996","unstructured":"Fernau, H., Lange, K.-J., Reinhardt, K.: Advocating ownership. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 286\u2013297. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-62034-6_57"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/S0019-9958(66)80019-0","volume":"9","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Greibach, S.: Deterministic context free languages. Inf. Control 9, 620\u2013648 (1966)","journal-title":"Inf. Control"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0019-9958(67)90513-X","volume":"11","author":"TN Hibbard","year":"1967","unstructured":"Hibbard, T.N.: A generalization of context-free determinism. Inf. Control 11, 196\u2013238 (1967)","journal-title":"Inf. Control"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-48686-0_19","volume-title":"Computing and Combinatorics","author":"P McKenzie","year":"1999","unstructured":"McKenzie, P., Reinhardt, K., Vinay, V.: Circuits and context-free languages. In: Asano, T., Imai, H., Lee, D.T., Nakano, S., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 194\u2013203. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48686-0_19"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1006\/inco.1995.1064","volume":"118","author":"R Niedermeier","year":"1995","unstructured":"Niedermeier, R., Rossmanith, P.: Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. Inf. Comput. 118, 227\u2013245 (1995)","journal-title":"Inf. Comput."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1142\/S0129054114400140","volume":"25","author":"G Pighizzini","year":"2014","unstructured":"Pighizzini, G., Pisoni, A.: Limited automata and regular languages. Int. J. Found. Comput. Sci. 25, 897\u2013916 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"21","author":"WL Ruzzo","year":"1980","unstructured":"Ruzzo, W.L.: Tree-size bounded alternation. J. Comput. System Sci. 21, 218\u2013235 (1980)","journal-title":"J. Comput. System Sci."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","volume":"22","author":"WL Ruzzo","year":"1981","unstructured":"Ruzzo, W.L.: On uniform circuit compelxity. J. Comput. Syst. Sci. 22, 365\u2013383 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/322077.322083","volume":"25","author":"IH Sudborough","year":"1978","unstructured":"Sudborough, I.H.: On the tape complexity of deterministic context-free languages. J. ACM 25, 405\u2013414 (1978)","journal-title":"J. ACM"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/0022-0000(91)90020-6","volume":"43","author":"H Venkateswaran","year":"1991","unstructured":"Venkateswaran, H.: Properties that characterize LOGCFL. J. Comput. Syst. Sci. 43, 380\u2013404 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Vinay, V.: Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In: Conference on Structure in Complexity Theory, pp. 270\u2013285 (1991)","DOI":"10.1109\/SCT.1991.160269"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-10801-4_40","volume-title":"SOFSEM 2019: Theory and Practice of Computer Science","author":"T Yamakami","year":"2019","unstructured":"Yamakami, T.: Behavioral strengths and weaknesses of various models of limited automata. In: Catania, B., Kr\u00e1lovi\u010d, R., Nawrocki, J., Pighizzini, G. (eds.) SOFSEM 2019. LNCS, vol. 11376, pp. 519\u2013530. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10801-4_40 A complete and corrected version is available at arXiv:2111.05000"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-030-40608-0_24","volume-title":"Language and Automata Theory and Applications","author":"T Yamakami","year":"2020","unstructured":"Yamakami, T.: Intersection and union hierarchies of deterministic context-free languages and pumping lemmas. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 341\u2013353. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_24 A complete and corrected version at arXiv:2112.09383"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-030-89543-3_14","volume-title":"Computing and Combinatorics","author":"T Yamakami","year":"2021","unstructured":"Yamakami, T.: Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-k storage automata. In: Chen, C.-Y., Hon, W.-K., Hung, L.-J., Lee, C.-W. (eds.) COCOON 2021. LNCS, vol. 13025, pp. 164\u2013175. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89543-3_14 An extended and corrected version is available at arXiv:2203.10193"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T10:28:34Z","timestamp":1728642514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_6"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}