{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:57:12Z","timestamp":1726037832810},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030248857"},{"type":"electronic","value":"9783030248864"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24886-4_8","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:02:56Z","timestamp":1563908576000},"page":"113-126","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Input-Driven Pushdown Automata for Edit Distance Neighborhood"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuzana","family":"Bedn\u00e1rov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Szabari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0201022","volume":"1","author":"A Aho","year":"1972","unstructured":"Aho, A., Peterson, T.: A minimum distance error-correcting parser for context-free languages. SIAM J. Comput. 1, 305\u2013312 (1972)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings ACM Symposium Theory of Computing, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"3","key":"8_CR3","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. Assoc. Comput. Mach. 56(3) (2009). Art. No.16","journal-title":"Journal of the ACM"},{"key":"8_CR4","first-page":"1","volume":"24","author":"B Braunm\u00fchl von","year":"1985","unstructured":"von Braunm\u00fchl, B., Verbeek, R.: Input driven languages are recognized in \n                      \n                        \n                      \n                      $$\\log n$$\n                     space. Ann. Discrete Math. 24, 1\u201320 (1985)","journal-title":"Ann. Discrete Math."},{"issue":"3:23","key":"8_CR5","first-page":"1","volume":"13","author":"K Chatterjee","year":"2017","unstructured":"Chatterjee, K., Henzinger, T.A., Ibsen-Jensen, R., Otop, J.: Edit distance for pushdown automata. Logical Methods Comput. Sci. 13(3:23), 1\u201323 (2017)","journal-title":"Logical Methods Comput. Sci."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-030-24886-4_9","volume-title":"DLT 2019","author":"H Cheon","year":"2019","unstructured":"Cheon, H., Han, Y.-S., Ko, S.-K., Salomaa, K.: The relative edit-distance between two input-driven languages. DLT 2019. LNCS, vol. 11647, pp. 127\u2013139. Springer, Heidelberg (2019)"},{"key":"8_CR7","first-page":"171","volume":"7","author":"F Damerau","year":"1964","unstructured":"Damerau, F.: A technique for computer detection and correction of spelling errors. Comm. Assoc. Comput. Mach. 7, 171\u2013176 (1964)","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-51963-0_30","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"Y-S Han","year":"2017","unstructured":"Han, Y.-S., Ko, S.-K.: Edit-distance between visibly pushdown languages. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 387\u2013401. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-51963-0_30"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1142\/S0129054113400315","volume":"24","author":"Y-S Han","year":"2013","unstructured":"Han, Y.-S., Ko, S.-K., Salomaa, K.: The edit-distance between a regular language and a context-free language. Int. J. Found. Comput. Sci. 24, 1067\u20131082 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J Hopcroft","year":"2001","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Harlow (2001)"},{"key":"8_CR11","unstructured":"Kruskal, J.: An overview of sequence comparison. In: Sankoff, D., Kruskal, J. (eds.) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, pp. 1\u201344. Addison-Wesley, Stanford (1983)"},{"key":"8_CR12","first-page":"707","volume":"10","author":"V Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl. 10, 707\u2013710 (1966)","journal-title":"Soviet Phys. Dokl."},{"key":"8_CR13","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"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054103002114","volume":"14","author":"M Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata: general definitions and algorithms. Int. J. Found. Comput. Sci. 14, 957\u2013982 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR15","first-page":"90","volume":"13","author":"H Morgan","year":"1970","unstructured":"Morgan, H.: Spelling correction in systems programs. Commun. Assoc. Comput. Mach. 13, 90\u201394 (1970)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1142\/S0129054118400099","volume":"29","author":"T Ng","year":"2018","unstructured":"Ng, T., Rappaport, D., Salomaa, K.: State complexity of neighbourhoods and approximate pattern matching. Int. J. Found. Comput. Sci. 29, 315\u2013329 (2018)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR17","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, 47\u201367 (2014)","journal-title":"SIGACT News"},{"key":"8_CR18","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":"8_CR19","unstructured":"Okhotin, A., Salomaa, K.: Edit distance neighbourhoods of input-driven pushdown automata. Theoret. Comput. Sci. (2019). \n                      https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397519301525"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2914","volume":"165","author":"G Pighizzini","year":"2001","unstructured":"Pighizzini, G.: How hard is computing the edit distance? Inform. Comput. 165, 1\u201313 (2001)","journal-title":"Inform. Comput."},{"key":"8_CR21","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 \n                      \n                        \n                      \n                      $$\\log n$$\n                     space recognition of input-driven languages. Inform. Process. Lett. 23, 81\u201384 (1986)","journal-title":"Inform. Process. Lett."},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1142\/S0129054107005443","volume":"18","author":"K Salomaa","year":"2007","unstructured":"Salomaa, K., Schofield, P.N.: State complexity of additive weighted finite automata. Int. J. Found. Comput. Sci. 18, 1407\u20131416 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. Assoc. Comput. Mach. 21, 168\u2013173 (1974)","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24886-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:03:46Z","timestamp":1563908626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24886-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030248857","9783030248864"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24886-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dlt2019.mimuw.edu.pl\/","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":"30","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":"20","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":"67% - 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","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":"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)"}}]}}