{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:12:26Z","timestamp":1794348746819,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540746201","type":"print"},{"value":"9783540746218","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-74621-8_17","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T07:46:32Z","timestamp":1187768792000},"page":"252-266","source":"Crossref","is-referenced-by-count":5,"title":["Visibly Pushdown Languages and Term Rewriting"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Chabin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"R\u00e9ty","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_31","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2006","unstructured":"Alur, R., Chaudhuri, S., Madhusudan, P.: Languages of Nested Trees. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, Springer, Heidelberg (2006)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/1007352.1007390","volume-title":"Proc. 36th ACM Symposium on Theory of Computing (STOC 2004)","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly Pushdown Languages. In: Proc. 36th ACM Symposium on Theory of Computing (STOC 2004), pp. 202\u2013211. ACM Press, New York (2004)"},{"key":"17_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (TATA), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/10719839","volume-title":"CADE 2000","author":"T. Genet","year":"2000","unstructured":"Genet, T., Klay, F.: Rewriting for cryptographic protocol verification. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, Springer, Heidelberg (2000)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45315-6_14","volume-title":"Foundations of Software Science and Computation Structures","author":"V. Gouranton","year":"2001","unstructured":"Gouranton, V., R\u00e9ty, P., Seidl, H.: Synchronized Tree Languages Revisited and New Applications. In: Honsell, F., Miculan, M. (eds.) ETAPS 2001 and FOSSACS 2001. LNCS, vol.\u00a02030, Springer, Heidelberg (2001)"},{"issue":"16","key":"17_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"4","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown Tree Automata. Mathematical Systems Theory\u00a04(16), 237\u2013263 (1983)","journal-title":"Mathematical Systems Theory"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Hermann, M., Galbav\u00fd, R.: Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theoretical Computer Science, 176 (1997)","DOI":"10.1016\/S0304-3975(96)00052-7"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-61464-8_65","volume-title":"RTA 1996","author":"F. Jacquemard","year":"1996","unstructured":"Jacquemard, F.: Decidable approximations of term rewrite systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 362\u2013376. Springer, Heidelberg (1996)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"S. Limet","year":"1999","unstructured":"Limet, S., R\u00e9ty, P.: A New Result about the Decidability of the Existential One-Step Rewriting Theory. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, Springer, Heidelberg (1999)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-540-25979-4_12","volume-title":"Rewriting Techniques and Applications","author":"S. Limet","year":"2004","unstructured":"Limet, S., Salzer, G.: Proving properties of term rewrite systems via logic programs. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 170\u2013184. Springer, Heidelberg (2004)"},{"key":"17_CR11","volume-title":"Electronic Notes in Theoretical Computer Science","author":"S. Limet","year":"2003","unstructured":"Limet, S., Salzer, G.: Manipulating tree tuple languages by transforming logic programs. In: Dahn, I., Vigneron, L. (eds.) Electronic Notes in Theoretical Computer Science, vol.\u00a086, Elsevier, Amsterdam (2003)"},{"key":"17_CR12","unstructured":"Lugiez, D., Schnoebelen, P.: The Regular Viewpoint on PA-Processes. Theoretical Computer Science (2000)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"T. Nagaya","year":"1999","unstructured":"Nagaya, T., Toyama, Y.: Decidability for Left-Linear Growing Term Rewriting Systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, Springer, Heidelberg (1999)"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.36045\/bbms\/1105730627","volume":"4","author":"J.C. Raoult","year":"1997","unstructured":"Raoult, J.C.: Rational Tree Relations. Bulletin of the Belgian Mathematical Society Simon Stevin\u00a04, 149\u2013176 (1997)","journal-title":"Bulletin of the Belgian Mathematical Society Simon Stevin"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T21:38:21Z","timestamp":1587850701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540746201","9783540746218"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}