{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:28:18Z","timestamp":1774798098693,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00193-2","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"129-165","source":"Crossref","is-referenced-by-count":7,"title":["A non-ambiguous decomposition of regular languages and factorizing codes"],"prefix":"10.1016","volume":"126","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00193-2_BIB1","series-title":"Proceedings of the Development on Language Theory 1999","first-page":"141","article-title":"A non-ambiguous language factorization problem","author":"Anselmo","year":"2000"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB2","series-title":"ICTCS 2001","first-page":"197","article-title":"Constructing finite maximal codes from Sch\u00fctzenberger Conjecture","volume":"Vol. 2202","author":"Anselmo","year":"2001"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB3","unstructured":"M. Anselmo, A. Restivo, Factorizing languages, in: B. Pehrson, I. Simon (Eds.), Proceedings of the 13th World Computer Congress IFIP 94, Vol. 1, Elsevier, North-Holland, Amsterdam, 1994, pp. 445\u2013450."},{"issue":"4","key":"10.1016\/S0166-218X(02)00193-2_BIB4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1142\/S0218196796000246","article-title":"On languages factorizing the free monoid","volume":"6","author":"Anselmo","year":"1996","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB5","first-page":"25","article-title":"On some factorization problems","volume":"4","author":"Anselmo","year":"1997","journal-title":"Bull. Belgian Math. Soc."},{"issue":"4","key":"10.1016\/S0166-218X(02)00193-2_BIB6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1051\/ita\/1989230403791","article-title":"Motifs et bases de langages","volume":"23","author":"Autebert","year":"1989","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1090\/S0002-9947-1969-0236208-5","article-title":"Centralizers in free associative algebras","volume":"137","author":"Bergman","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB8","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB9","doi-asserted-by":"crossref","unstructured":"J. Berstel, Ch. Reutenauer, Rational series and their languages, EATCS Monographs, Vol. 12, Springer, Berlin, 1988.","DOI":"10.1007\/978-3-642-73235-5"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB10","doi-asserted-by":"crossref","unstructured":"A. Bertoni, P. Massazza, On the square root of regular languages, Proceedings of the FPSAC\u201900, Springer, Berlin, 2000, pp. 125\u2013134.","DOI":"10.1007\/978-3-662-04166-6_11"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB11","unstructured":"J.M. Bo\u00eb, Factorisation par exc\u00e9s du mono\u00efde libre, LIRMM Report 94-005, 1994."},{"issue":"3","key":"10.1016\/S0166-218X(02)00193-2_BIB12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1051\/ita\/1989230302951","article-title":"Factorisation des Ensembles Pr\u00e9fixiels","volume":"23","author":"Bruy\u00e8re","year":"1989","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB13","first-page":"412","article-title":"Research topics in the theory of codes","volume":"48","author":"Bruy\u00e8re","year":"1992","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB14","series-title":"Formal Language Theory, Perspectives and Open Problems","article-title":"Open problems about regular languages","author":"Brzozowsky","year":"1980"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB15","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/321495.321505","article-title":"On decomposition of regular events","volume":"16","author":"Brzozowsky","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB16","unstructured":"C. Choffrut, J. Karhum\u00e4ki, N. Ollinger, The commutation of finite sets: a challenging problem, TUCS Technical Report No. 303, 1999, http:\/\/www.tucs.fi\/."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB17","series-title":"Regular Algebra and Finite Machines","author":"Conway","year":"1971"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB18","doi-asserted-by":"crossref","unstructured":"C. De Felice, Construction et compl\u00e9tion de codes finis, Th\u00e8se de 3\u00e8me cycle, Rapport LITP, Vol. 85, No. 3, 1985.","DOI":"10.1016\/0304-3975(85)90033-7"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(89)90076-5","article-title":"Construction of a family of finite maximal codes","volume":"63","author":"De Felice","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(93)90291-Z","article-title":"A partial result about the factorization conjecture for finite variable-length codes","volume":"122","author":"De Felice","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB21","unstructured":"S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press, New York, 1974."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB22","unstructured":"P. Enflo, A. Granville, J. Shallit, S. Yu, On sparse languages L such that LL=\u03a3*."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB23","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB24","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"2001"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB25","doi-asserted-by":"crossref","unstructured":"J. Karhum\u00e4ki, I. Petre, On the centralizer of a finite set, Proceedings of the ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 536\u2013546.","DOI":"10.1007\/3-540-45022-X_45"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB26","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1051\/ita\/1987210404371","article-title":"Codes limit\u00e9s et factorisations finies du mono\u00efde libre","volume":"21","author":"Krob","year":"1987","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB27","doi-asserted-by":"crossref","unstructured":"N.H. Lam, On codes having no finite completion, Proceedings of the STACS 94, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 691\u2013698.","DOI":"10.1007\/3-540-57785-8_182"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB28","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1142\/S0218196701000711","article-title":"On the root of Languages","volume":"11","author":"Massazza","year":"2001","journal-title":"Internat. J. Algebra Comput."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB29","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/TC.1968.229096","article-title":"On concatenative decompositions of regular events","volume":"EC17","author":"Paz","year":"1968","journal-title":"IEEE Trans. Electron. Comput."},{"key":"10.1016\/S0166-218X(02)00193-2_BIB30","doi-asserted-by":"crossref","unstructured":"D. Perrin, Finite automata, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, North-Holland, Amsterdam, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50006-8"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB31","unstructured":"D. Perrin, M.P. Sch\u00fctzenberger, Un probl\u00e8me \u00e9l\u00e9mentaire de la th\u00e9orie de l'information, Th\u00e9orie Inform.\u2014Colloq. Internat. CNRS 276 (1977) 249\u2013260."},{"issue":"4","key":"10.1016\/S0166-218X(02)00193-2_BIB32","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1051\/ita\/1989230404251","article-title":"Codes et motifs","volume":"23","author":"Ratoandromanana","year":"1989","journal-title":"RAIRO Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB33","doi-asserted-by":"crossref","unstructured":"A. Restivo, Some decision results for recognizable sets in arbitrary monoids, Proceedings of ICALP 78, Lecture Notes in Computer Science, Vol. 62, Springer, Berlin, 1978.","DOI":"10.1007\/3-540-08860-1_27"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB34","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0022-4049(85)90069-6","article-title":"Non commutative factorization of variable-length codes","volume":"36","author":"Reutenauer","year":"1985","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB35","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB36","series-title":"Proceedings of the Development on Language Theory 1999","first-page":"22","article-title":"On the decomposition of finite languages","author":"Salomaa","year":"2000"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB37","doi-asserted-by":"crossref","first-page":"209","DOI":"10.24033\/bsmf.1623","article-title":"Sur certains sous-mono\u00efdes libres","volume":"93","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Bull. Soc. Math. France"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB38","doi-asserted-by":"crossref","unstructured":"I. Simon, Locally finite semigroups and limited subsets of a free monoid, Universidade de Sao Paulo, 1978, preprint.","DOI":"10.1109\/SFCS.1978.21"},{"key":"10.1016\/S0166-218X(02)00193-2_BIB39","series-title":"Words, Languages and Combinatorics II","first-page":"477","article-title":"Two classes of factorizing codes-(p,p)-codes and (4,4)-codes","author":"Zang","year":"1994"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001932?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02001932?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:10:27Z","timestamp":1580875827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02001932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":39,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02001932"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00193-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}