{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:50Z","timestamp":1760202710145},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_19","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T07:52:20Z","timestamp":1467705140000},"page":"224-235","source":"Crossref","is-referenced-by-count":4,"title":["Prefix Distance Between Regular Languages"],"prefix":"10.1007","author":[{"given":"Timothy","family":"Ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"issue":"8","key":"19_CR1","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1016\/j.jcss.2013.06.001","volume":"79","author":"M Benedikt","year":"2013","unstructured":"Benedikt, M., Puppis, G., Riveros, C.: Bounded repairability of word languages. J. Comput. Syst. Sci. 79(8), 1302\u20131321 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tcs.2014.04.021","volume":"539","author":"M Benedikt","year":"2014","unstructured":"Benedikt, M., Puppis, G., Riveros, C.: The per-character cost of repairing word languages. Theor. Comput. Sci. 539, 38\u201367 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1051\/ita:2006010","volume":"40","author":"D Bruschi","year":"2006","unstructured":"Bruschi, D., Pighizzini, G.: String distances and intrusion detection: bridging the gap between formal languages and computer security. RAIRO Informatique Th\u00e9orique et Appl. 40, 303\u2013313 (2006)","journal-title":"RAIRO Informatique Th\u00e9orique et Appl."},{"issue":"1","key":"19_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0304-3975(01)00238-9","volume":"286","author":"C Choffrut","year":"2002","unstructured":"Choffrut, C., Pighizzini, G.: Distances between languages and reflexivity of relations. Theor. Comput. Sci. 286(1), 117\u2013138 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00234-2","volume-title":"Encyclopedia of Distances","author":"MM Deza","year":"2009","unstructured":"Deza, M.M., Deza, E.: Encyclopedia of Distances. Springer, Berlin, Heidelberg (2009)"},{"key":"19_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Berline, Heidelberg (2009)"},{"issue":"07","key":"19_CR8","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1142\/S0129054113400315","volume":"24","author":"YS 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(07), 1067\u20131082 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2\/3","key":"19_CR9","first-page":"293","volume":"9","author":"L Kari","year":"2004","unstructured":"Kari, L., Konstantinidis, S.: Descriptional complexity of error\/edit systems. J. Autom. Lang. Comb. 9(2\/3), 293\u2013309 (2004)","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"19_CR10","first-page":"445","volume":"1","author":"L Kari","year":"2004","unstructured":"Kari, L., Konstantinidis, S., Perron, S., Wozniak, G., Xu, J.: Computing the hamming distance of a regular language in quadratic time. WSEAS Trans. Inf. Sci. Appl. 1(1), 445\u2013449 (2004)","journal-title":"WSEAS Trans. Inf. Sci. Appl."},{"issue":"9","key":"19_CR11","doi-asserted-by":"crossref","first-page":"1307","DOI":"10.1016\/j.ic.2007.06.001","volume":"205","author":"S Konstantinidis","year":"2007","unstructured":"Konstantinidis, S.: Computing the edit distance of a regular language. Inf. Comput. 205(9), 1307\u20131316 (2007)","journal-title":"Inf. Comput."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-2010-287","volume":"101","author":"S Konstantinidis","year":"2010","unstructured":"Konstantinidis, S., Silva, P.V.: Computing maximal error-detecting capabilities and distances of regular languages. Fundam. Inform. 101, 257\u2013270 (2010)","journal-title":"Fundam. Inform."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-319-04298-5_37","volume-title":"SOFSEM 2014: Theory and Practice of Computer Science","author":"M Kutrib","year":"2014","unstructured":"Kutrib, M., Meckel, K., Wendlandt, M.: Parameterized prefix distance between regular languages. In: Geffert, V., Preneel, B., Rovan, B., \u0160tuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 419\u2013430. Springer, Heidelberg (2014)"},{"issue":"6","key":"19_CR14","doi-asserted-by":"crossref","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(6), 957\u2013982 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"19_CR15","doi-asserted-by":"crossref","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? Inf. Computat. 165(1), 1\u201313 (2001)","journal-title":"Inf. Computat."},{"key":"19_CR16","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2009","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2009)"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 41\u2013110. Springer, Berlin, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T08:21:46Z","timestamp":1600849306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}