{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:18Z","timestamp":1725550638749},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_6","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:04:06Z","timestamp":1129817046000},"page":"96-109","source":"Crossref","is-referenced-by-count":2,"title":["Outfix-Free Regular Languages and Prime Outfix-Free Decomposition"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"6_CR1","first-page":"121","volume":"56","author":"M.-P. B\u00e9al","year":"2003","unstructured":"B\u00e9al, M.-P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundamenta Informaticae\u00a056(1-2), 121\u2013135 (2003)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"6_CR2","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":"6_CR3","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)"},{"issue":"3","key":"6_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\u00a067(3), 111\u2013117 (1998)","journal-title":"Information Processing Letters"},{"key":"6_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":"6_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(97)00166-7","volume":"215","author":"D. Giammarresi","year":"1999","unstructured":"Giammarresi, D., Montalbano, R.: Deterministic generalized automata. Theoretical Computer Science\u00a0215, 191\u2013208 (1999)","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","unstructured":"Han, Y.-S., Trippen, G., Wood, D.: Simple-regular expressions and languages. In: Proceedings of DCFS 2005, pp. 146\u2013157 (2005)"},{"key":"6_CR8","unstructured":"Han, Y.-S., Wang, Y., Wood, D.: Infix-free regular expressions and languages. To appear in International Journal of Foundations of Computer Science (2005)"},{"key":"6_CR9","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":"3","key":"6_CR10","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":"6_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/00207168908803768","volume":"30","author":"M. Ito","year":"1989","unstructured":"Ito, M., J\u00fcrgensen, H., Shyr, H.-J., Thierrin, G.: N-prefix-suffix languages. International Journal of Computer Mathematics\u00a030, 37\u201356 (1989)","journal-title":"International Journal of Computer Mathematics"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/0022-0000(91)90026-2","volume":"43","author":"M. Ito","year":"1991","unstructured":"Ito, M., J\u00fcrgensen, H., Shyr, H.-J., Thierrin, G.: Outfix and infix codes and related classes of languages. Journal of Computer and System Sciences\u00a043, 484\u2013508 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR13","unstructured":"J\u00fcrgensen, H.: Infix codes. In: Proceedings of Hungarian Computer Science Conference, pp. 25\u201329 (1984)"},{"key":"6_CR14","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)"},{"issue":"1-2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0304-3975(97)00097-2","volume":"188","author":"D.Y. Long","year":"1997","unstructured":"Long, D.Y., Ma, J., Zhou, D.: Structure of 3-infix-outfix maximal codes. Theoretical Computer Science\u00a0188(1-2), 231\u2013240 (1997)","journal-title":"Theoretical Computer Science"},{"key":"6_CR16","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages. Technical Report 222, TUCS (1998)"},{"issue":"3","key":"6_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":"6_CR18","volume-title":"Lecture Notes: Free Monoids and Languages","author":"H.-J. Shyr","year":"1991","unstructured":"Shyr, H.-J.: Lecture Notes: Free Monoids and Languages. Hon Min Book Company, Taichung (1991)"},{"key":"6_CR19","volume-title":"Data structures, algorithms, and performance","author":"D. Wood","year":"1993","unstructured":"Wood, D.: Data structures, algorithms, and performance. Addison-Wesley Longman Publishing Co., Inc., Boston (1993)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T22:16:45Z","timestamp":1547763405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11560647_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}