{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:42Z","timestamp":1725663582553},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540534143"},{"type":"electronic","value":"9783540468691"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[[1990]]},"DOI":"10.1007\/3-540-53414-8_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:02:45Z","timestamp":1330207365000},"page":"120-129","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Proofs and reachability problem for ground rewrite systems"],"prefix":"10.1007","author":[{"given":"J. L.","family":"Coquid\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Gilleron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(69)90065-5","volume":"14","author":"W.S Brainerd","year":"1969","unstructured":"Brainerd, W.S, Tree generating regular systems, Inf. and control, 14 (1969), pp217\u2013231.","journal-title":"Inf. and control"},{"key":"8_CR2","unstructured":"Coquid\u00e9, J.L., Ph.D, Lille, to appear. (1990)."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Courcelle, B.,On recognizable sets and tree automata, Resolution of Equations in Algebraic Structures, Academic Press, M.Nivat & H. Ait-Kaci edts, (1989).","DOI":"10.1016\/B978-0-12-046370-1.50009-7"},{"key":"8_CR4","unstructured":"Dauchet, M., Deruyver, A., \"VALERIANN\":Compilation of Ground Term Rewriting Systems and Applications, Rewriting Technics and Applications, (1989), Lec. Notes Comp. Sci., 355(Dershowitz ed.)."},{"key":"8_CR5","volume-title":"2nd Symposium on Logic in Computer Science","author":"M. Dauchet","year":"1987","unstructured":"Dauchet, M., Heuillard, P., Lescanne, P., Tison, S., Decidability of the Confluence of Ground Term Rewriting Systems, 2nd Symposium on Logic in Computer Science, New-York, IEEE Computer Society Press (1987)"},{"key":"8_CR6","unstructured":"Dauchet, M., Tison, S., Decidability of Confluence in Ground Term Rewriting Systems, Fondations of Computation Theory, Cottbus, Lec. Notes Comp. Sci., 199, (1985)"},{"key":"8_CR7","unstructured":"Dauchet, M., Tison, S., The theory of Ground Rewrite System is Decidable, IEEE Symposium on Logic in Computer Science, to appear, (1990)"},{"key":"8_CR8","unstructured":"Deruyver, A., Gilleron, R., Compilation of Term Rewriting Systems, CAAP 89, Lec. Notes. Comp. Sci., (Diaz ed), 354, (1989)"},{"key":"8_CR9","unstructured":"Dershowitz, N., Jouannaud, J.P., Rewrite systems, Handbook of Theoretical Computer Science, J.V.Leeuwen editor, North-Holland, to appear.(1989)."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Bottom-up and Top-down Tree Transformations, a Comparison, Math. Systems Theory, 9, (1975)","DOI":"10.1007\/BF01704020"},{"key":"8_CR11","unstructured":"F\u00fcl\u00f6p, Z., V\u00e0gv\u00f6lgyi, S., Ground Term Rewriting rules for the Word Problem of Ground Term Equations, submitted paper, (1989)."},{"key":"8_CR12","unstructured":"Gecseg, F., Steinby, M., Tree automata, Akademiai Kiado, (1984)."},{"key":"8_CR13","unstructured":"Gilleron, R., Ph.D, Lille, to appear (1990)."},{"key":"8_CR14","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"Huet, G., Oppen, D.C., Equations and Rewrite Rules: A survey, in R.V. Book, ed., New York, Academic Press, Formal Language Theory: Perspectives and Open Problems, (1980)."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Nelson, G., Oppen, D.C., Fast Decision Procedures Based on Congruence Closure, JACM, 27, (1980).","DOI":"10.1145\/322186.322198"},{"key":"8_CR16","unstructured":"Oyamaguchi, M., The reachability Problem for Quasi-ground Term Rewriting Systems, Journal of Information Processing, 9-4, (1986)."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Tison, S., The Fair Termination is decidable for Ground Systems, Rewriting Technics and Applications, Chapel Hill, Lec. Notes Comp. Sci., 355 (Dershowitz ed.), (1989).","DOI":"10.1007\/3-540-51081-8_126"}],"container-title":["Lecture Notes in Computer Science","Aspects and Prospects of Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53414-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:42:28Z","timestamp":1558269748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53414-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540534143","9783540468691"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-53414-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}