{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T08:32:38Z","timestamp":1785227558448,"version":"3.55.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319986531","type":"print"},{"value":"9783319986548","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_36","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"441-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"36_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). \n                    https:\/\/doi.org\/10.1145\/1007352.1007390","DOI":"10.1145\/1007352.1007390"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-0208(08)73072-X","volume":"24","author":"B Braunm\u00fchl von","year":"1985","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input driven languages are recognized in log n space. Ann. Discrete Math. 24, 1\u201320 (1985). \n                    https:\/\/doi.org\/10.1016\/S0304-0208(08)73072-X","journal-title":"Ann. Discrete Math."},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-23111-2_7","volume-title":"Machines, Computations, and Universality","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Tinput-driven pushdown automata. In: Durand-Lose, J., Nagy, B. (eds.) MCU 2015. LNCS, vol. 9288, pp. 94\u2013112. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-23111-2_7"},{"issue":"4","key":"36_CR4","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539793252092","volume":"27","author":"H Leung","year":"1998","unstructured":"Leung, H.: Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata. SIAM J. Comput. 27(4), 1073\u20131082 (1998)","journal-title":"SIAM J. Comput."},{"key":"36_CR5","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). \n                    https:\/\/doi.org\/10.1007\/3-540-10003-2_89"},{"issue":"2","key":"36_CR6","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. SIGACT News 45(2), 47\u201367 (2014). \n                    https:\/\/doi.org\/10.1145\/2636805.2636821","journal-title":"SIGACT News"},{"key":"36_CR7","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. Theoret. Comput. Sci. 566, 1\u201311 (2015). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2014.11.015","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR8","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). \n                    https:\/\/doi.org\/10.1016\/j.jcss.2017.02.001","journal-title":"J. Comput. Syst. Sci."},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-58747-9_23","volume-title":"Computer Science \u2013 Theory and Applications","author":"A Okhotin","year":"2017","unstructured":"Okhotin, A., Salomaa, K.: Edit distance neighbourhoods of input-driven pushdown automata. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 260\u2013272. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-58747-9_23"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-319-60252-3_24","volume-title":"Descriptional Complexity of Formal Systems","author":"A Okhotin","year":"2017","unstructured":"Okhotin, A., Salomaa, K.: The quotient operation on input-driven pushdown automata. In: Pighizzini, G., C\u00e2mpeanu, C. (eds.) DCFS 2017. LNCS, vol. 10316, pp. 299\u2013310. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-60252-3_24"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-94631-3_19","volume-title":"Descriptional Complexity of Formal Systems","author":"A Okhotin","year":"2018","unstructured":"Okhotin, A., Salomaa, K.: Further closure properties of input-driven pushdown automata. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018, pp. 224\u2013236. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-94631-3_19\n                    \n                  . to appear"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"3290","DOI":"10.1016\/j.tcs.2009.05.002","volume":"410","author":"X Piao","year":"2009","unstructured":"Piao, X., Salomaa, K.: Operational state complexity of nested word automata. Theoret. Comput. Sci. 410, 3290\u20133302 (2009). \n                    https:\/\/doi.org\/10.1016\/j.tcs.2009.05.002","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/j.ic.2010.11.021","volume":"209","author":"K Salomaa","year":"2011","unstructured":"Salomaa, K.: Limitations of lower bound methods for deterministic nested word automata. Inf. Comput. 209, 580\u2013589 (2011). \n                    https:\/\/doi.org\/10.1016\/j.ic.2010.11.021","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:18:17Z","timestamp":1535915897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}