{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:49:34Z","timestamp":1725562174865},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_27","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:06:41Z","timestamp":1280747201000},"page":"378-392","source":"Crossref","is-referenced-by-count":1,"title":["On Term Rewriting Systems Having a Rational Derivation"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-45657-0_47","volume-title":"Computer Aided Verification","author":"P. Abdulla","year":"2002","unstructured":"Abdulla, P., Jonsson, B., Mahata, P., D\u2019Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 555\u2013568. Springer, Heidelberg (2002)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45657-0_46","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2002","unstructured":"Bouajjani, A., Touili, T.: Extrapolating tree transformations. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 539\u2013554. Springer, Heidelberg (2002)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-49382-2_31","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"H. Calbrix","year":"1998","unstructured":"Calbrix, H., Knapik, T.: A string-rewriting characterization of Muller and Schupp\u2019s context-free graphs. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 331\u2013342. Springer, Heidelberg (1998)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-46432-8_4","volume-title":"Foundation of Software Science and Computation Structures","author":"D. Caucal","year":"2000","unstructured":"Caucal, D.: On word rewriting systems having a rational derivation. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 48\u201362. Springer, Heidelberg (2000)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45687-2_14","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D., Knapik, T.: A Chomsky-like hierarchy of infinite graphs. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 177\u2013187. Springer, Heidelberg (2002)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-45465-9_10","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2002","unstructured":"Colcombet, T.: On families of graphs having a decidable first order theory with reachability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 98\u2013109. Springer, Heidelberg (2002)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0028794","volume-title":"Fundamentals of Computation Theory","author":"M. Dauchet","year":"1985","unstructured":"Dauchet, M., Tison, S.: Decidability of the confluence of finite ground term rewrite systems. In: Budach, L. (ed.) FCT 1985. LNCS, vol.\u00a0199, pp. 80\u201389. Springer, Heidelberg (1985)"},{"key":"27_CR9","first-page":"242","volume-title":"LICS 90th","author":"M. Dauchet","year":"1990","unstructured":"Dauchet, M., Tison, S.: The theory of ground rewrite systems is decidable. In: LICS 90th, pp. 242\u2013248. IEEE, Los Alamitos (1990)"},{"issue":"1-2","key":"27_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(96)00333-7","volume":"194","author":"P. Gyenizse","year":"1998","unstructured":"Gyenizse, P., V\u00e1gv\u00f6lgyi, S.: Linear generalized semi-monadic rewrite systems effectively preserve recognizability. TCS\u00a0194(1-2), 87\u2013122 (1998)","journal-title":"TCS"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/inco.2001.3077","volume":"171","author":"K. Lodaya","year":"2001","unstructured":"Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Information and Computation\u00a0171(2), 269\u2013293 (2001)","journal-title":"Information and Computation"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-45841-7_46","volume-title":"STACS 2002","author":"C. L\u00f6ding","year":"2002","unstructured":"L\u00f6ding, C.: Ground tree rewriting graphs of bounded tree width. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 559\u2013570. Springer, Heidelberg (2002)"},{"key":"27_CR13","unstructured":"Raoult, J.-C.: A survey of tree transductions. Technical Report 1410, Inria (April 1991)"},{"key":"27_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 Mathematics Society\u00a04, 149\u2013176 (1997)","journal-title":"Bulletin of the Belgian Mathematics Society"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 246\u2013260. Springer, Heidelberg (2000)"}],"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\/978-3-540-24727-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T17:46:25Z","timestamp":1591724785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}