{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T10:46:44Z","timestamp":1655635604425},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540418641","type":"print"},{"value":"9783540453154","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45315-6_14","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:28:39Z","timestamp":1196645319000},"page":"214-229","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Synchronized Tree Languages Revisited and New Applications"],"prefix":"10.1007","author":[{"given":"Val\u00e9rie","family":"Gouranton","sequence":"first","affiliation":[]},{"given":"Pierre","family":"R\u00e9ty","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process algebra. In Cambridge Tracts in Theoretical Computer Science, volume 18, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The Monadic Second-Order Logic of Graphs I, Recognizable Sets of Finite Graphs. In Inf. Comp., volume 85, pages 12\u201375, 1990.","journal-title":"Inf. Comp."},{"key":"14_CR3","unstructured":"V. Gouranton, P. R\u00e9ty, and H. Seidl. Synchronized Tree Languages Revisited and New Applications. Research Report 2000-16, LIFO, 2000. \n http:\/\/www.univ-orleans.fr\/SCIENCES\/LIFO\/Members\/rety\/publications.html\n \n ."},{"key":"14_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BFb0030616","volume-title":"Proceedings of 6th Colloquium on Trees in Algebra and Programming","author":"S. Limet","year":"1997","unstructured":"S. Limet and P. R\u00e9ty. E-Unification by Means of Tree Tuple Synchronized Grammars. In Proceedings of 6th Colloquium on Trees in Algebra and Programming, volume 1214 of LNCS, pages 429\u2013440. Springer-Verlag, 1997."},{"key":"14_CR5","first-page":"69","volume":"1","author":"S. Limet","year":"1997","unstructured":"S. Limet and P. R\u00e9ty. E-Unification by Means of Tree Tuple Synchronized Grammars. Discrete Mathematics and Theoritical Computer Science (\n http:\/\/dmtcs.loria.fr\/\n \n ), 1:69\u201398, 1997.","journal-title":"Discrete Mathematics and Theoritical Computer Science"},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0052365","volume-title":"Proceedings of 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japon)","author":"S. Limet","year":"1998","unstructured":"S. Limet and P. R\u00e9ty. Solving Disequations modulo some Class of Rewrite Systems. In Proceedings of 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japon), volume 1379 of LNCS, pages 121\u2013135. Springer-Verlag, 1998."},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy)","author":"S. Limet","year":"1999","unstructured":"S. Limet and P. R\u00e9ty. A New Result about the Decidability of the Existential One-step Rewriting Theory. In Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy), volume 1631 of LNCS. Springer-Verlag, 1999."},{"key":"14_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BFb0000483","volume-title":"proc of the 6th Conf. on Algebraic Methodology and Software Technology, Sydney (Australia)","author":"S. Limet","year":"1997","unstructured":"S. Limet and F. Saubion. On partial validation of logic programs. In M. Johnson, editor, proc of the 6th Conf. on Algebraic Methodology and Software Technology, Sydney (Australia), volume 1349 of LNCS, pages 365\u2013379. Springer Verlag, 1997."},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","volume-title":"ICALP","author":"D. Lugiez","year":"2000","unstructured":"D. Lugiez and P. Schnoebelen. Decidable firt-order transition logics for PA-processes. In Springer, editor, ICALP, LNCS, Geneva, Switzerland, July 2000."},{"key":"14_CR10","unstructured":"D. Lugiez and P. Schnoebelen. The regular viewpoint on PA-processes. Theoretical Computer Science, 2000."},{"key":"14_CR11","series-title":"Technical Report","volume-title":"A structural approach of operational semantics","author":"G.D. Plotkin","year":"1981","unstructured":"G.D. Plotkin. A structural approach of operational semantics. Technical Report FN-19, DAIMI, Aarhus University, Denmark, 1981."},{"key":"14_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy)","author":"F. Saubion","year":"1999","unstructured":"F. Saubion and I. St\u00e9phan. On Implementation of Tree Synchronized Languages. In Proceedings of 10th Conference on Rewriting Techniques and Applications, Trento (Italy), LNCS. Springer-Verlag, 1999."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(94)00130-8","volume":"52","author":"H. Seidl","year":"1994","unstructured":"H. Seidl. Haskell Overloading is DEXPTIME Complete. Information Processing Letters, 52(2):57\u201360, 1994.","journal-title":"Information Processing Letters"},{"key":"14_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/3-540-48321-7_40","volume-title":"Proceedings of the twelfth International Conference on Fundamentals of Computation theory","author":"F. Seynhaeve","year":"1999","unstructured":"F. Seynhaeve, S. Tison, and M. Tommasi. Homomorphisms and concurrent term rewriting. In G. Ciobanu and G. Paun, editors, Proceedings of the twelfth International Conference on Fundamentals of Computation theory, number 1684 in Lecture Notes in Computer Science, pages 475\u2013487, Iasi, Romania, 1999."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45315-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:22:37Z","timestamp":1558264957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45315-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418641","9783540453154"],"references-count":14,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45315-6_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]},"assertion":[{"value":"23 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}