{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:26Z","timestamp":1725888986345},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_23","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T14:59:13Z","timestamp":1496415553000},"page":"287-298","source":"Crossref","is-referenced-by-count":0,"title":["State Complexity of Suffix Distance"],"prefix":"10.1007","author":[{"given":"Timothy","family":"Ng","sequence":"first","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s00224-013-9515-7","volume":"54","author":"J Brzozowski","year":"2014","unstructured":"Brzozowski, J., Jir\u00e1skov\u00e1, G., Zou, C.: Quotient complexity of closed languages. Theory Comput. Syst. 54(2), 277\u2013292 (2014)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"23_CR2","first-page":"141","volume":"8","author":"CS Calude","year":"2002","unstructured":"Calude, C.S., Salomaa, K., Yu, S.: Additive distances and quasi-distances between words. J. Univers. Comput. Sci. 8(2), 141\u2013152 (2002)","journal-title":"J. Univers. Comput. Sci."},{"issue":"1","key":"23_CR3","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. Theoret. Comput. Sci. 286(1), 117\u2013138 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR4","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, Heidelberg (2009)"},{"key":"23_CR5","unstructured":"Gao, Y., Moreira, N., Reis, R., Yu, S.: A survey on operational state complexity. To appear in Computer Science Review, September 2015. \narXiv:1509.03254v1\n\n [cs.FL]"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.ic.2010.11.013","volume":"209","author":"M Holzer","year":"2011","unstructured":"Holzer, M., Kutrib, M.: Descriptional and computational complexity of finite automata\u2014a survey. Inf. Comput. 209, 456\u2013470 (2011)","journal-title":"Inf. Comput."},{"key":"23_CR7","doi-asserted-by":"crossref","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":"23_CR8","first-page":"293","volume":"9","author":"L Kari","year":"2004","unstructured":"Kari, L., Konstantinidis, S.: Descriptional complexity of error\/edit systems. J. Automata Lang. Comb. 9, 293\u2013309 (2004)","journal-title":"J. Automata Lang. Comb."},{"key":"23_CR9","unstructured":"Kari, L., Konstantinidis, S., Kopecki, S., Yang, M.: An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. CoRR abs\/1406.1041 (2014)"},{"key":"23_CR10","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, 1307\u20131316 (2007)","journal-title":"Inf. Comput."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2014). doi:\n10.1007\/978-3-319-04298-5_37"},{"key":"23_CR12","first-page":"70","volume":"111","author":"M Kutrib","year":"2013","unstructured":"Kutrib, M., Pighizzini, G.: Recent trends in descriptional complexity of formal languages. Bull. EATCS 111, 70\u201386 (2013)","journal-title":"Bull. EATCS"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algorithms on words. In: Applied Combinatorics on Words. Encyclopedia of Mathematics and it\u2019s Applications, vol. 105. Cambridge University Press, New York (2005)","DOI":"10.1017\/CBO9781107341005.002"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-319-21500-6_31","volume-title":"Developments in Language Theory","author":"T Ng","year":"2015","unstructured":"Ng, T., Rappaport, D., Salomaa, K.: State complexity of neighbourhoods and approximate pattern matching. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 389\u2013400. Springer, Cham (2015). doi:\n10.1007\/978-3-319-21500-6_31"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-22360-5_20","volume-title":"Implementation and Application of Automata","author":"T Ng","year":"2015","unstructured":"Ng, T., Rappaport, D., Salomaa, K.: State complexity of prefix distance. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 238\u2013249. Springer, Cham (2015). doi:\n10.1007\/978-3-319-22360-5_20"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-41114-9_15","volume-title":"Descriptional Complexity of Formal Systems","author":"T Ng","year":"2016","unstructured":"Ng, T., Rappaport, D., Salomaa, K.: State complexity of prefix distance of subregular languages. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 192\u2013204. Springer, Cham (2016). doi:\n10.1007\/978-3-319-41114-9_15"},{"key":"23_CR17","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":"23_CR18","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, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T15:04:19Z","timestamp":1496415859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}