{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:55Z","timestamp":1759637635962,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946306"},{"type":"electronic","value":"9783319946313"}],"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-94631-3_19","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T06:09:52Z","timestamp":1531202992000},"page":"224-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Further Closure Properties of Input-Driven Pushdown Automata"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"19_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":"19_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"Rajeev Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009). https:\/\/doi.org\/10.1145\/1516512.1516518","journal-title":"Journal of the ACM"},{"key":"19_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$$ space. Ann. Discret. Math. 24, 1\u201320 (1985). https:\/\/doi.org\/10.1016\/S0304-0208(08)73072-X","journal-title":"Ann. Discret. Math."},{"issue":"4","key":"19_CR4","first-page":"455","volume":"7","author":"M Domaratzki","year":"2002","unstructured":"Domaratzki, M.: State complexity of proportional removals. J. Autom. Lang. Comb. 7(4), 455\u2013468 (2002)","journal-title":"J. Autom. Lang. Comb."},{"issue":"12","key":"19_CR5","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ipl.2011.03.019","volume":"111","author":"J Esparza","year":"2011","unstructured":"Esparza, J., Ganty, P., Kiefer, S., Luttenberger, M.: Parikh\u2019s theorem: a simple and direct automaton construction. Inf. Process. Lett. 111(12), 614\u2013619 (2011). https:\/\/doi.org\/10.1016\/j.ipl.2011.03.019","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"19_CR6","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1142\/S0129054114400103","volume":"25","author":"D Go\u010d","year":"2014","unstructured":"Go\u010d, D., Palioudakis, A., Salomaa, K.: Nondeterministic state complexity of proportional removals. Int. J. Found. Comput. Sci. 25(7), 823\u2013836 (2014). https:\/\/doi.org\/10.1142\/S0129054114400103","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","volume":"6","author":"LH Haines","year":"1969","unstructured":"Haines, L.H.: On free monoids partially ordered by embedding. J. Comb. Theory 6, 94\u201398 (1969). https:\/\/doi.org\/10.1016\/S0021-9800(69)80111-0","journal-title":"J. Comb. Theory"},{"issue":"7","key":"19_CR8","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1142\/S0129054116500349","volume":"27","author":"Y-S Han","year":"2016","unstructured":"Han, Y.-S., Ko, S.-K., Ng, T., Salomaa, K.: State complexity of insertion. Int. J. Found. Comput. Sci. 27(7), 863\u2013878 (2016). https:\/\/doi.org\/10.1142\/S0129054116500349","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00236-015-0245-y","volume":"53","author":"Y-S Han","year":"2016","unstructured":"Han, Y.-S., Ko, S.-K., Salomaa, K.: State complexity of deletion and bipolar deletion. Acta Informatica 53(1), 67\u201385 (2016). https:\/\/doi.org\/10.1007\/s00236-015-0245-y","journal-title":"Acta Informatica"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1016\/j.tcs.2009.01.004","volume":"410","author":"Y-S Han","year":"2009","unstructured":"Han, Y.-S., Salomaa, K.: Nondeterministic state complexity of nested word automata. Theor. Comput. Sci. 410, 2961\u20132971 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.01.004","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"s3\u20132","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. s3\u20132(1), 326\u2013336 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.3233\/FI-2009-0035","volume":"91","author":"H Gruber","year":"2009","unstructured":"Gruber, H., Holzer, M., Kutrib, M.: More on the size of Higman-Haines sets: effective constructions. Fundamenta Informaticae 91(1), 105\u2013121 (2009). https:\/\/doi.org\/10.3233\/FI-2009-0035","journal-title":"Fundamenta Informaticae"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2015.09.028","volume":"610","author":"P. Karandikar","year":"2016","unstructured":"Karandikar, P., Niewerth, M., Schnoebelen, Ph.: On the state complexity of closures and interiors of regular languages with subwords and superwords. Theor. Comput. Sci. 610(A), 91\u2013107 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.09.028","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(78)90156-5","volume":"21","author":"J van Leeuven","year":"1978","unstructured":"van Leeuven, J.: Effective construction in well-partially-ordered free monoids. Discrete Math. 21(3), 237\u2013252 (1978). https:\/\/doi.org\/10.1016\/0012-365X(78)90156-5","journal-title":"Discrete Math."},{"key":"19_CR15","first-page":"1373","volume":"11","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Soviet Math. Dokl. 11, 1373\u20131375 (1970)","journal-title":"Soviet Math. Dokl."},{"key":"19_CR16","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":"3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.3233\/FI-2010-252","volume":"99","author":"A Okhotin","year":"2010","unstructured":"Okhotin, A.: On the state complexity of scattered substrings and superstrings. Fundamenta Informaticae 99(3), 325\u2013338 (2010). https:\/\/doi.org\/10.3233\/FI-2010-252","journal-title":"Fundamenta Informaticae"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.tcs.2016.01.007","volume":"618","author":"A Okhotin","year":"2016","unstructured":"Okhotin, A.: Input-driven languages are linear conjunctive. Theor. Comput. Sci. 618, 52\u201371 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.01.007","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR19","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). https:\/\/doi.org\/10.1145\/2636805.2636821","journal-title":"SIGACT News"},{"key":"19_CR20","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":"19_CR21","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":"19_CR22","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). https:\/\/doi.org\/10.1007\/978-3-319-58747-9_23"},{"key":"19_CR23","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). https:\/\/doi.org\/10.1007\/978-3-319-60252-3_24"},{"key":"19_CR24","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. Theor. Comput. Sci. 410, 3290\u20133302 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.05.002","journal-title":"Theor. Comput. Sci."},{"key":"19_CR25","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). https:\/\/doi.org\/10.1016\/j.ic.2010.11.021","journal-title":"Inf. Comput."},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0304-3975(76)90030-X","volume":"2","author":"JI Seiferas","year":"1976","unstructured":"Seiferas, J.I., McNaughton, R.: Regularity-preserving relations. Theor. Comput. Sci. 2(2), 147\u2013154 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90030-X","journal-title":"Theor. Comput. Sci."}],"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-319-94631-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:16:49Z","timestamp":1710325009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","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":"Halifax, NS","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}