{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:51Z","timestamp":1725664311161},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615507"},{"type":"electronic","value":"9783540705970"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61550-4_169","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:54:46Z","timestamp":1330293286000},"page":"443-456","source":"Crossref","is-referenced-by-count":1,"title":["Equations on trees"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"34_CR1","unstructured":"S. Eilenberg. Automata, Languages and Machines. Vol. A, Academic Press, 1974."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"C. C. Elgot","year":"1978","unstructured":"C. C. Elgot, S. L. Bloom, R. Tindell. \u201cOn the algebraic structure of rooted trees\u201d. J. Comput. System Sci. 16, pagg. 362\u2013399, 1978.","journal-title":"J. Comput. System Sci."},{"key":"34_CR3","unstructured":"D. Giammarresi, S. Mantaci, F. Mignosi, A. Restivo. \u201cPeriodicities on trees\u201d. Preprint, 1995."},{"key":"34_CR4","first-page":"473","volume-title":"Proc. 13th World Computer Congress \u2014 IFIP '94, Amburgo, Germania, 1994","author":"D. Giammarresi","year":"1994","unstructured":"D. Giammarresi, S. Mantaci, F. Mignosi, A. Restivo. \u201cA periodicity theorem for trees\u201d. Proc. 13th World Computer Congress \u2014 IFIP '94, Amburgo, Germania, 1994; vol. A-51 pagg. 473\u2013478. Elsevier Science B. V. (North-Holland), 1994."},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/78935.78938","volume":"37","author":"J. Jaffar","year":"1990","unstructured":"J. Jaffar. \u201cMinimal and complete word unification\u201d. J. ACM vol. 37; pagg. 47\u201385, 1990.","journal-title":"J. ACM"},{"key":"34_CR6","unstructured":"A. Lentin, M. P. Sch\u00fctzenberger. \u201cA combinatorial problem in the theory of free monoids\u201d. Proc. of the University of North Carolina; pagg. 67\u201385, 1967."},{"key":"34_CR7","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"M. Lothaire. Combinatorics on Words. Addison-Wesley, Reading, MA 1983."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R. C. Lyndon","year":"1962","unstructured":"R. C. Lyndon, M. P. Sch\u00fctzenberger. \u201cThe equation a\n\n                  m\n                =b\n\n                  n\n                \nc\n\n                  p\n                 in a free group\u201d. Michigan Math. J. vol. 9; pagg. 289\u2013298, 1962.","journal-title":"Michigan Math. J."},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G. S. Makanin","year":"1977","unstructured":"G. S. Makanin. \u201cThe problem of solvability of equations in a free semigroup\u201d. Math, USSR Sbornik vol. 32; pagg. 129\u2013198, 1977. (in AMS, 1979).","journal-title":"Math, USSR Sbornik"},{"key":"34_CR10","first-page":"1","volume-title":"Tree automata and languages","author":"M. Nivat","year":"1992","unstructured":"M. Nivat. \u201cBinary tree codes\u201d. Tree automata and languages; pagg. 1\u201319 Elsevier Science Publishers B. V. (North-Holland), 1992."},{"key":"34_CR11","unstructured":"J. Thatcher. \u201cTree automata,an informal survey\u201d in A. Aho (ed.), Currents in the theory of computing, Pretence Hall, 1973."},{"key":"34_CR12","unstructured":"W. Thomas. \u201cLogical aspects in the theory of tree languages\u201d in B. Courcelle (ed.), Proceedings ninth colloquium on Trees in Algebra and Programming, Cambridge University Press, 1984."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61550-4_169.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:34:11Z","timestamp":1619573651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61550-4_169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615507","9783540705970"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-61550-4_169","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}