{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:32Z","timestamp":1725543092247},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_49","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"469-478","source":"Crossref","is-referenced-by-count":0,"title":["Overlap-Free Regular Languages"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Handbook of Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/B978-0-444-88071-0.50010-2","volume-title":"Algorithms and Complexity","author":"A. Aho","year":"1990","unstructured":"Aho, A.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) Algorithms and Complexity. Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 255\u2013300. The MIT Press, Cambridge (1990)"},{"key":"49_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. Journal of the ACM\u00a011, 481\u2013494 (1964)","journal-title":"Journal of the ACM"},{"issue":"3","key":"49_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1145\/256167.256174","volume":"19","author":"C.L.A. 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\u00a019(3), 413\u2013426 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"49_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1142\/S0129054103002151","volume":"14","author":"J. Czyzowicz","year":"2003","unstructured":"Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science\u00a014, 1019\u20131032 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.4153\/CJM-1958-023-9","volume":"10","author":"S. Golomb","year":"1958","unstructured":"Golomb, S., Gordon, B., Welch, L.: Comma-free codes. The Canadian Journal of Mathematics\u00a010, 202\u2013209 (1958)","journal-title":"The Canadian Journal of Mathematics"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11496656_26","volume-title":"Combinatorial Pattern Matching","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wang, Y., Wood, D.: Prefix-free regular-expression matching. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 298\u2013309. Springer, Heidelberg (2005)"},{"issue":"2","key":"49_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1142\/S0129054106003887","volume":"17","author":"Y.-S. Han","year":"2006","unstructured":"Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. International Journal of Foundations of Computer Science\u00a017(2), 379\u2013393 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"49_CR9","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1142\/S0129054105003121","volume":"16","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. International Journal of Foundations of Computer Science\u00a016(3), 499\u2013510 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/11537311_48","volume-title":"Fundamentals of Computation Theory","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: A new linearizing restriction in the pattern matching problem. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 552\u2013562. Springer, Heidelberg (2005)"},{"key":"49_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11560647_6","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: Outfix-free regular languages and prime outfix-free decomposition. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 96\u2013109. Springer, Heidelberg (2005)"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11605157_12","volume-title":"Implementation and Application of Automata","author":"Y.-S. Han","year":"2006","unstructured":"Han, Y.-S., Wood, D.: Shorter regular expressions from finite-state automata. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 141\u2013152. Springer, Heidelberg (2006)"},{"key":"49_CR13","volume-title":"Formal Languages and Their Relationship to Automata","author":"J. Hopcroft","year":"1969","unstructured":"Hopcroft, J., Ullman, J.: Formal Languages and Their Relationship to Automata. Addison-Wesley, Reading (1969)"},{"key":"49_CR14","volume-title":"IEEE standard for information technology: Portable Operating System Interface (POSIX): part 2, shell and utilities","author":"IEEE","year":"1993","unstructured":"IEEE: IEEE standard for information technology: Portable Operating System Interface (POSIX): part 2, shell and utilities. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"49_CR15","series-title":"Handbook of Formal Languages","first-page":"511","volume-title":"Word, Language, Grammar","author":"H. J\u00fcrgensen","year":"1997","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol.\u00a01, pp. 511\u2013607. Springer, Heidelberg (1997)"},{"key":"49_CR16","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages. Technical Report 222, TUCS (1998)"},{"issue":"3","key":"49_CR17","first-page":"339","volume":"15","author":"A. Mateescu","year":"2002","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica\u00a015(3), 339\u2013351 (2002)","journal-title":"Acta Cybernetica"},{"key":"49_CR18","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Communications of the ACM\u00a011, 419\u2013422 (1968)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:26:43Z","timestamp":1619508403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11809678_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}