{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:45:05Z","timestamp":1757450705900,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031711114"},{"type":"electronic","value":"9783031711121"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71112-1_18","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:02:14Z","timestamp":1725328934000},"page":"249-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact Descriptional Complexity of\u00a0Determinization of\u00a0Input-Driven Pushdown Automata"],"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"}]}],"member":"297","published-online":{"date-parts":[[2024,9,3]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","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:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007390","DOI":"10.1145\/1007352.1007390"},{"issue":"3","key":"18_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":"18_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-0208(08)73072-X","volume":"24","author":"B von Braunm\u00fchl","year":"1985","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input driven languages are recognized in log $$n$$. Ann. Discrete Math. 24, 1\u201320 (1985). https:\/\/doi.org\/10.1016\/S0304-0208(08)73072-X","journal-title":"Ann. Discrete Math."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.tcs.2022.10.023","volume":"939","author":"Y-S Han","year":"2023","unstructured":"Han, Y.-S., Ko, S.-K., Salomaa, K.: Deciding path size of nondeterministic (and input-driven) pushdown automata. Theor. Comput. Sci. 939, 170\u2013181 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.10.023","journal-title":"Theor. Comput. Sci."},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-319-98654-8_36","volume-title":"Developments in Language Theory","author":"G Jir\u00e1skov\u00e1","year":"2018","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: Towards exact state complexity bounds for input-driven pushdown automata. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 441\u2013452. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_36"},{"issue":"1\u20132","key":"18_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2017-1576","volume":"155","author":"M Kutrib","year":"2017","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Tinput-driven pushdown, counter, and stack automata. Fundamenta Informaticae 155(1\u20132), 59\u201388 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1576","journal-title":"Fundamenta Informaticae"},{"key":"18_CR7","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"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-031-09574-0_16","volume-title":"Computer Science \u2013 Theory and Applications","author":"M Ogawa","year":"2022","unstructured":"Ogawa, M., Okhotin, A.: On the determinization of event-clock input-driven pushdown automata. In: Kulikov, A.S., Raskhodnikova, S. (eds.) CSR 2022. LNCS, vol. 13296, pp. 256\u2013268. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09574-0_16"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-31644-9_13","volume-title":"Languages Alive","author":"A Okhotin","year":"2012","unstructured":"Okhotin, A., Piao, X., Salomaa, K.: Descriptional complexity of input-driven pushdown automata. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive. LNCS, vol. 7300, pp. 186\u2013206. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31644-9_13"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/2636805.2636821","volume":"45","author":"A Okhotin","year":"2014","unstructured":"Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. ACM SIGACT News 45(2), 47\u201367 (2014). https:\/\/doi.org\/10.1145\/2636805.2636821","journal-title":"ACM SIGACT News"},{"key":"18_CR11","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":"18_CR12","doi-asserted-by":"publisher","unstructured":"Rose, A., Okhotin, A.: Probabilistic input-driven pushdown automata. In: 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). LIPIcs, vol. 272, pp. 78:1\u201378:14 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2023.78","DOI":"10.4230\/LIPIcs.MFCS.2023.78"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(86)90047-5","volume":"23","author":"W Rytter","year":"1986","unstructured":"Rytter, W.: An application of Mehlhorn\u2019s algorithm for bracket languages to log n space recognition of input-driven languages. Inf. Process. Lett. 23, 81\u201384 (1986). https:\/\/doi.org\/10.1016\/0020-0190(86)90047-5","journal-title":"Inf. Process. Lett."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-95891-8_50","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"N Van Tang","year":"2009","unstructured":"Van Tang, N., Ogawa, M.: Event-clock visibly pushdown automata. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 558\u2013569. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-95891-8_50"}],"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-71112-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:03:47Z","timestamp":1725329027000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71112-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031711114","9783031711121"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71112-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 September 2024","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":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","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":"wia2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}