{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:40:22Z","timestamp":1737290422907,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_10","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:28:09Z","timestamp":1184603289000},"page":"148-160","source":"Crossref","is-referenced-by-count":8,"title":["Regular Sets of Descendants for Constructor-Based Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Pierre","family":"R\u00e9ty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"H. Comon. Sequentiality, second order monadic logic and tree automata. In Proc., Tenth Annual IEEE Symposium on Logic in Computer Science, pages 508\u2013517. IEEE Computer Society Press, 26\u201329 June 1995.","DOI":"10.1109\/LICS.1995.523285"},{"key":"10_CR2","unstructured":"H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications (TATA). http:\/\/13ux02.univ-lille3.fr\/tata ."},{"key":"10_CR3","unstructured":"Hubert Comon and Florent Jacquemard. Ground reducibility is exptime-complete. In Proc. IEEE Symp. on Logic in Computer Science, Varsaw, June 1997. IEEE Comp. Soc. Press."},{"key":"10_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-53904-2_104","volume-title":"Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy)","author":"J. Coquid\u00e9","year":"1991","unstructured":"J. Coquid\u00e9, M. Dauchet, R. Gilleron, and S. Vagvolgyi. Bottom-up Tree Pushdown Automata and Rewrite Systems. In R. V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of LNCS, pages 287\u2013298. Springer-Verlag, April 1991."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc., Fifth Annual IEEE Symposium on Logic in Computer Science, pages 242\u2013248, Philadelphia, Pennsylvania, 1990. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1990.113750"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. Van Leuven, editor, Handbook of Theoretical Computer Science, chapter 6, pages 243\u2013320. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0052368","volume-title":"Proceedings of 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japan)","author":"T. Genet","year":"1998","unstructured":"T. Genet. Decidable Approximations of Sets of Descendants and Sets of Normal Forms. In Proceedings of 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japan), volume 1379 of LNCS, pages 151\u2013165. Springer-Verlag, 1998."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.3233\/FI-1995-24127","volume":"24","author":"R. Gilleron","year":"1995","unstructured":"R. Gilleron and S. Tison. Regular Tree Languages and Rewrite Systems. Fundamenta Informaticae, 24:157\u2013175, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"10_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"Proceedings 7th Conference RTA, New Brunswick (USA)","author":"F. Jacquemard","year":"1996","unstructured":"F. Jacquemard. Decidable Approximations of Term Rewrite Systems. In H. Ganzinger, editor, Proceedings 7th Conference RTA, New Brunswick (USA), volume 1103 of LNCS, pages 362\u2013376. Springer-Verlag, 1996."},{"key":"10_CR10","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":"10_CR11","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, 1:69\u201398, 1997. ( http:\/\/dmtcs.loria.fr\/ ).","journal-title":"Discrete Mathematics and Theoritical Computer Science"},{"key":"10_CR12","unstructured":"P. R\u00e9ty. M\u00e9thodes d\u2019Unification par Surr\u00e9duction. Th\u00e8se de Doctorat d\u2019Universit\u00e9, Universit\u00e9 de Nancy I, March 1988. In french."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"K. Salomaa. Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. The Journal of Computer and System Sciences, 37:367\u2013394, 1988.","journal-title":"The Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming and Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:00:28Z","timestamp":1737288028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}