{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T10:30:21Z","timestamp":1777113021011,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00317-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:54Z","timestamp":1027633914000},"page":"483-509","source":"Crossref","is-referenced-by-count":12,"title":["Codes and equations on trees"],"prefix":"10.1016","volume":"255","author":[{"given":"Sabrina","family":"Mantaci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00317-5_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0021-8693(79)90113-3","article-title":"Sur le theoreme des defaut","volume":"60","author":"Berstel","year":"1979","journal-title":"J. Algebra"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB3","doi-asserted-by":"crossref","unstructured":"C. Choffrut, J. Karhum\u00e4ki, Combinatorics on words, in: G. Rozenberg, A. Salomaa, Handbook of Formal Languages, Vol. 3, Springer, Berlin, 1997.","DOI":"10.1007\/978-3-642-59136-5_6"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB4","first-page":"323","article-title":"Unique decipherability for partially commutative alphabets","volume":"X","author":"Chrobak","year":"1987","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB5","volume":"vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB6","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","article-title":"On the algebraic structure of rooted trees","volume":"16","author":"Elgot","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB7","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg, M. Steinby, Tree languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Springer, Berlin, 1997.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB8","unstructured":"D. Giammarresi, S. Mantaci, F. Mignosi, A. Restivo, Congruence, Automata and Periodicities, in: J. Almeida, G.M.S. Gomes, P.V. Silva (Eds.), Proc. Semigroups, Automata and Languages, Portugal, 1994, (World Scientific Publishing, Singapore, 1996, pp. 125\u2013135."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB9","unstructured":"D. Giammarresi, S. Mantaci, F. Mignosi, A. Restivo, A periodicity theorem for trees, Proc. 13th. World Computer Congress \u2013 IFIP\u201994, Vol. A-51, Elsevier Science B.V., North-Holland, Amsterdam, 1994, pp. 473\u2013478."},{"issue":"1-2","key":"10.1016\/S0304-3975(99)00317-5_BIB10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0304-3975(97)00072-8","article-title":"Periodicities on trees","volume":"205","author":"Giammarresi","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","article-title":"The undecidability of the second-order unification problem","volume":"13","author":"Goldfarb","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0304-3975(96)00216-2","article-title":"The code problem for traces \u2013 improving the boundaries","volume":"172","author":"Hoogeboom","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB13","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/78935.78938","article-title":"Minimal and complete word unification","volume":"37","author":"Jaffar","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.3233\/FI-1999-381210","article-title":"Defect theorems for trees","volume":"38","author":"Karhum\u00e4ki","year":"1999","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB15","doi-asserted-by":"crossref","unstructured":"J. Karhum\u00e4ki, S. Mantaci, Defect theorems for trees, (Conference Version), Proc. of Developments in Language Theory (1999), to appear.","DOI":"10.1142\/9789812792464_0014"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB16","unstructured":"A. Lentin, M.P. Sch\u00fctzenberger, A combinatorial problem in the theory of free monoids, Proc. University of North Carolina, 1967, pp. 67\u201385."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB17","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation am = bncp in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","article-title":"The problem of solvability of equations in a free semigroup","volume":"32","author":"Makanin","year":"1977","journal-title":"Math. USSR Sbornik"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB20","doi-asserted-by":"crossref","unstructured":"S. Mantaci, D. Micciancio, An algorithm for the solution of tree equations, Proc. CAAP-TAPSOFT\u201997, Lecture Notes in Computer Science, Vol. 1214, 1997, pp. 417\u2013428.","DOI":"10.1007\/BFb0030615"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB21","doi-asserted-by":"crossref","unstructured":"S. Mantaci, A. Restivo, Equations on trees, Proc. MFCS\u201996, Lecture Notes in Computer Science, Vol. 1113, 1996, pp. 443\u2013456.","DOI":"10.1007\/3-540-61550-4_169"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB22","unstructured":"S. Mantaci, A. Restivo, Tree codes and equations, Proc. 3rd Internat. Conf. Developments in Language Theory, 1997, pp. 119\u2013133."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB23","unstructured":"S. Mantaci, A. Restivo, On the defect theorem for trees, Proc. \u201c8th Internat. Conf. Automata and Formal Languages\u201d, Salg\u00f3tarj\u00e1n, Ungheria, Pub. Math, Debrecen 54-supplement (1999) 923\u2013932."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB24","first-page":"23","article-title":"Mots et Codes. Cas d\u00e9cidables et ind\u00e9cidables di probl\u00e8me du codage pour les mono\u0131\u0308des partialment commutatifs","volume":"27","author":"Matyiasevitch","year":"1997","journal-title":"Quadrature. Mag. Math. Pure App."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB25","series-title":"Binary tree codes, Tree Automata and Languages","first-page":"1","author":"Nivat","year":"1992"},{"key":"10.1016\/S0304-3975(99)00317-5_BIB26","unstructured":"L. Oget, A least common divisor for trees, Internal Report."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB27","unstructured":"J. Tatcher, Tree automata, an informal survey, in: A. Aho (Ed.), Currents in the Theory of Computing, Pretince-Hall, Englewood Cliffs, NJ, 1973."},{"key":"10.1016\/S0304-3975(99)00317-5_BIB28","unstructured":"W. Thomas, Logical aspects in the theory of tree languages, in: B. Courcelle (Ed.), Proc. 9 colloquium on Trees in Algebra and Programming, Cambridge University Press, Cambridge, 1984."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599003175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T05:42:15Z","timestamp":1620798135000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599003175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599003175"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00317-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}