{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:54:04Z","timestamp":1743036844983,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_21","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"349-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Input-Driven Pushdown Automata on Well-Nested Infinite Strings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1615-2725","authenticated-orcid":false,"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4316-0859","authenticated-orcid":false,"given":"Victor L.","family":"Selivanov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: ACM Symposium on Theory of Computing (STOC 2004), Chicago, USA, 13\u201316 June 2004, pp. 202\u2013211 (2004). https:\/\/doi.org\/10.1145\/1007352.1007390","DOI":"10.1145\/1007352.1007390"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1\u201343 (2009). https:\/\/doi.org\/10.1145\/1516512.1516518","journal-title":"J. ACM"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input driven languages are recognized in log n space. In: Annals of Discrete Mathematics, vol. 24, pp. 1\u201320 (1985). https:\/\/doi.org\/10.1016\/S0304-0208(08)73072-X","DOI":"10.1016\/S0304-0208(08)73072-X"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1016\/S0304-3975(02)00567-4","volume":"290","author":"J Duparc","year":"2003","unstructured":"Duparc, J.: A hierarchy of deterministic context-free $$\\omega $$-languages. Theor. Comput. Sci. 290(3), 1253\u20131300 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1017\/jsl.2019.51","volume":"85","author":"J Duparc","year":"2020","unstructured":"Duparc, J., Vuilleumier, L.: The Wadge order on the Scott domain is not a well-quasi-order. J. Symb. Log. 85(1), 300\u2013324 (2020)","journal-title":"J. Symb. Log."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-45321-2_4","volume-title":"Language, Culture, Computation. Computing - Theory and Technology","author":"O Finkel","year":"2014","unstructured":"Finkel, O.: Topological complexity of context-free $$\\omega $$-languages: a survey. In: Dershowitz, N., Nissan, E. (eds.) Language, Culture, Computation. Computing - Theory and Technology. LNCS, vol. 8001, pp. 50\u201377. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45321-2_4"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-540-30538-5_34","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"C L\u00f6ding","year":"2004","unstructured":"L\u00f6ding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 408\u2013420. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30538-5_34"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-10003-2_89","volume-title":"Automata, Languages and Programming","author":"K Mehlhorn","year":"1980","unstructured":"Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL-recognition. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 422\u2013435. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_89"},{"issue":"8","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1017\/S0960129513000339","volume":"25","author":"L Motto Ros","year":"2015","unstructured":"Motto Ros, L., Schlicht, P., Selivanov, V.: Wadge-like reducibilities on arbitrary quasi-Polish spaces. Math. Struct. Comput. Sci. 25(8), 1705\u20131754 (2015)","journal-title":"Math. Struct. Comput. Sci."},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. In: SIGACT News, vol. 45, no. 2, pp. 47\u201367 (2014). https:\/\/doi.org\/10.1145\/2636805.2636821","DOI":"10.1145\/2636805.2636821"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.11.015","volume":"566","author":"A Okhotin","year":"2015","unstructured":"Okhotin, A., Salomaa, K.: Descriptional complexity of unambiguous input-driven pushdown automata. Theor. Comput. Sci. 566, 1\u201311 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.11.015","journal-title":"Theor. Comput. Sci."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jcss.2017.02.001","volume":"86","author":"A Okhotin","year":"2017","unstructured":"Okhotin, A., Salomaa, K.: State complexity of operations on input-driven pushdown automata. J. Comput. Syst. Sci. 86, 207\u2013228 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.02.001","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR13","unstructured":"Wadge, W.: Reducibility and determinateness in the Baire space. PhD thesis, University of California, Berkely (1984)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K Wagner","year":"1979","unstructured":"Wagner, K.: On $$\\omega $$-regular sets. Inf. Control 43, 123\u2013177 (1979)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:22:22Z","timestamp":1623972142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"41% - 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.1","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":"9.2","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)"}}]}}