{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:24:07Z","timestamp":1725456247915},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0030615","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:10:41Z","timestamp":1133399441000},"page":"417-428","source":"Crossref","is-referenced-by-count":1,"title":["An algorithm for the solution of tree equations"],"prefix":"10.1007","author":[{"given":"Sabrina","family":"Mantaci","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Micciancio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","volume":"13","author":"W. Goldfarb","year":"1981","unstructured":"Goldfarb, W.: The Undecidability of the Second-Order Unification Problem. Theoretical Computer Science\n 13 (1981) 225\u2013230.","journal-title":"Theoretical Computer Science"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/78935.78938","volume":"37","author":"J. Jaffar","year":"1990","unstructured":"Jaffar, J.: Minimal and complete word unification. J. ACM\n 37 (1990) 47\u201385.","journal-title":"J. ACM"},{"key":"34_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G. S. Makanin","year":"1977","unstructured":"Makanin, G. S.: The problem of solvability of equations in a free semigroup. Math, USSR Sbornik\n 32 (1977) (in AMS 1979) 129\u2013198.","journal-title":"Math, USSR Sbornik"},{"key":"34_CR4","first-page":"443","volume":"1113","author":"S. Mantaci","year":"1996","unstructured":"Mantaci, S., Restivo, A.: Equations on trees. em Proc. of 21st MFCS(1996), vol.1113 of LNCS 443\u2013456.","journal-title":"LNCS"},{"key":"34_CR5","unstructured":"Markov, A. A.: The Theory of Algorithm. Trudy Math. Inst. Steklov, 42, (1954)."},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A., Montanari, U.: An efficient unification algorithm, TOPLAS 4:2 (1982), 258\u2013282.","journal-title":"TOPLAS"},{"key":"34_CR7","first-page":"1","volume-title":"Binary tree codes. Tree automata and languages","author":"M. Nivat","year":"1992","unstructured":"M. Nivat: Binary tree codes. Tree automata and languages, Elsevier Science Publishers B.V. (North-Holland), (1992). 1\u201319"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T00:59:41Z","timestamp":1549414781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0030615","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}