{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:17Z","timestamp":1760202677569,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_21","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"264-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalizations of Code Languages with Marginal Errors"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Ki","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"21_CR1","unstructured":"B\u00e9al, M.P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundamenta Informaticae 56(1,2), 121\u2013135 (2002)"},{"key":"21_CR2","unstructured":"Berstel, J., Perrin, D.: Theory of codes. Academic Press, Inc. (1985)"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1145\/256167.256174","volume":"19","author":"CLA Clarke","year":"1997","unstructured":"Clarke, C.L.A., Cormack, G.V.: On the use of regular expressions for searching text. ACM Transactions on Programming Languages and Systems 19(3), 413\u2013426 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Information Processing Letters 67(3), 111\u2013117 (1998)","journal-title":"Information Processing Letters"},{"key":"21_CR5","first-page":"118","volume":"93","author":"YS Han","year":"2007","unstructured":"Han, Y.S.: Decision algorithms for subfamilies of regular languages using state-pair graphs. Bulletin of the European Association for Theoretical Computer Science 93, 118\u2013133 (2007)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1142\/S0129054113500238","volume":"24","author":"YS Han","year":"2013","unstructured":"Han, Y.S.: An improved prefix-free regular-expression matching. International Journal of Foundations of Computer Science 24(5), 679\u2013687 (2013)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"16","key":"21_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3233\/FUN-2007-761-208","volume":"76","author":"YS Han","year":"2007","unstructured":"Han, Y.S., Salomaa, K., Wood, D.: Intercode regular languages. Fundamenta Informaticae 76(16), 113\u2013128 (2007)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0129054106003887","volume":"17","author":"YS Han","year":"2006","unstructured":"Han, Y.S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. International Journal of Foundations of Computer Science 17(2), 379\u2013393 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1\u20132","key":"21_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.tcs.2007.10.017","volume":"389","author":"YS Han","year":"2007","unstructured":"Han, Y.S., Wang, Y., Wood, D.: Prefix-free regular languages and pattern matching. Theoretical Computer Science 389(1\u20132), 307\u2013317 (2007)","journal-title":"Theoretical Computer Science"},{"key":"21_CR10","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Company Incorporated (2006)"},{"issue":"9","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D Huffman","year":"1952","unstructured":"Huffman, D.: A method for the construction of minimum-redundancy codes. Proceedings of the IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proceedings of the IRE"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-59136-5_8","volume":"1","author":"H J\u00fcrgensen","year":"1997","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. Word, Language, Grammar, Handbook of Formal Languages 1, 511\u2013607 (1997)","journal-title":"Word, Language, Grammar, Handbook of Formal Languages"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2014.07.015","volume":"550","author":"L Kari","year":"2014","unstructured":"Kari, L., Konstantinidis, S., Kopecki, S.: On the maximality of languages with combined types of code properties. Theoretical Computer Science 550, 79\u201389 (2014)","journal-title":"Theoretical Computer Science"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11925903_10","volume-title":"DNA Computing","author":"L Kari","year":"2006","unstructured":"Kari, L., Mahalingam, K.: DNA Codes and Their Properties. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol. 4287, pp. 127\u2013142. Springer, Heidelberg (2006)"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Konitzer, M., Simon, H.U.: DFA with a Bounded Activity Level. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 478\u2013489. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-04921-2_39"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2001","unstructured":"Marathe, A., Condon, A.E., Corn, R.M.: On combinatorial dna word design. Journal of Computational Biology 8(3), 201\u2013219 (2001)","journal-title":"Journal of Computational Biology"},{"issue":"4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"EL Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bulletin of the American Mathematical Society 52(4), 264\u2013268 (1946)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"21_CR18","unstructured":"Wood, D.: Theory of Computation. Harper & Row (1987)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T09:29:53Z","timestamp":1748510993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}