{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T08:05:08Z","timestamp":1784189108961,"version":"3.55.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032320155","type":"print"},{"value":"9783032320162","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T00:00:00Z","timestamp":1784246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T00:00:00Z","timestamp":1784246400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32016-2_13","type":"book-chapter","created":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T07:24:18Z","timestamp":1784186658000},"page":"163-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Determinizing k-Path Input-Driven PDAs"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Zakzok","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,17]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: ACM Symposium on Theory of Computation, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009)","DOI":"10.1145\/1516512.1516518"},{"key":"13_CR3","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press (1999)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.tcs.2022.10.023","volume":"939","author":"YS Han","year":"2023","unstructured":"Han, Y.S., Ko, S.K., Salomaa, K.: Deciding path size of nondeterministic (and input-driven) pushdown automata. Theoret. Comput. Sci. 939, 170\u2013181 (2023)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.14232\/actacyb.23.1.2017.9","volume":"23","author":"YS Han","year":"2017","unstructured":"Han, Y.S., Salomaa, A., Salomaa, K.: Ambiguity, nondeterminism and state complexity of finite automata. Acta Cybernet. 23, 141\u2013157 (2017)","journal-title":"Acta Cybernet."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.2001.3069","volume":"172","author":"J Hromkovi\u010d","year":"2002","unstructured":"Hromkovi\u010d, J., Seibert, S., Karhum\u00e4ki, J., Klauck, H., Schnitger, G.: Communication complexity method for measuring nondeterminism in finite automata. Inf. Comput. 172, 202\u2013217 (2002)","journal-title":"Inf. Comput."},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Martynova, O.: Exact descriptional complexity of determinization of input-driven pushdown automata. In: Implementation and Application of Automata: 28th International Conference. CIAA 2024, pp. 249\u2013260. Springer-Verlag, Berlin, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-71112-1_18","DOI":"10.1007\/978-3-031-71112-1_18"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL recognition. In: Automata. Languages and Programming, 1980, pp. 422\u2013435. Springer, LNCS (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_89","DOI":"10.1007\/3-540-10003-2_89"},{"key":"13_CR9","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-31644-9_13"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Okhotin, A., Salomaa, K.: Complexity of input-driven pushdown automata. SIGACT News 45(2), 47\u201367 (2014)","DOI":"10.1145\/2636805.2636821"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Okhotin, A., Salomaa, K.: Input-driven pushdown automata with limited nondeterminism. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 84\u2013102. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09698-8_9","DOI":"10.1007\/978-3-319-09698-8_9"},{"issue":"2\u20134","key":"13_CR12","first-page":"245","volume":"17","author":"A Palioudakis","year":"2012","unstructured":"Palioudakis, A., Salomaa, K., Akl, S.G.: State complexity of finite tree width NFAs. J. Autom. Lang. Comb. 17(2\u20134), 245\u2013264 (2012)","journal-title":"J. Autom. Lang. Comb."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Stanley, R.P., Fomin, S.: Trees and the Composition of Generating Functions, p. 1\u2013158. Cambridge Studies in Advanced Mathematics, Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511609589.004"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Zakzok, M., Salomaa, K.: Improved upper bounds for determinizing NIDPDAs with limited nondeterminism. In: Ko, S.K., Manea, F. (eds.) Developments in Language Theory, vol. 16036, pp. 166\u2013181. Springer International Publishing (2025). https:\/\/doi.org\/10.1007\/978-3-032-01475-7_12","DOI":"10.1007\/978-3-032-01475-7_12"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32016-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T07:24:21Z","timestamp":1784186661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32016-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,17]]},"ISBN":["9783032320155","9783032320162"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32016-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,17]]},"assertion":[{"value":"17 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kingston, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2026","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":"dcfs2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/research.cs.queensu.ca\/dcfs2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}