{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:48Z","timestamp":1762458948984},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:00Z","timestamp":1330292400000},"page":"362-376","source":"Crossref","is-referenced-by-count":43,"title":["Decidable approximations of term rewriting systems"],"prefix":"10.1007","author":[{"given":"Florent","family":"Jacquemard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"28_CR1","volume-title":"Sequentially, second-order monadic logic and tree automata","author":"H. Comon","year":"1995","unstructured":"H. Comon. Sequentially, second-order monadic logic and tree automata. In Tenth Annual IEEE Symposium on Logic in Computer Science, San Diego, CA, June 1995. IEEE Comp. Soc. Press."},{"key":"28_CR2","unstructured":"H. Comon, M. Haberstrau, and J.-P. Jouannaud. Decidable properties of shallow equational theories. In Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science. IEEE Comp. Soc. Press, 1992."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"M. Dauchet. Simulation of a turing machine by a left-linear rewrite rule. In Proc. 3rd Rewriting Techniques and Applications, Chapel Hill, LNCS 355, 1989.","DOI":"10.1007\/3-540-51081-8_103"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, 1990.","DOI":"10.1109\/LICS.1990.113750"},{"key":"28_CR5","unstructured":"M. Dauchet, S. Tison, T. Heuillard, and P. Lescanne. Decidability of the confluence of ground term rewriting systems. Technical Report IT-102, LIFL, Universit\u00e9 de Lille, May 1987. Actes de logic in Computer Science Second Annual Conference New-York Juin 87."},{"key":"28_CR6","first-page":"448","volume-title":"Termination of linear rewriting systems","author":"N. Dershowitz","year":"1981","unstructured":"N. Dershowitz. Termination of linear rewriting systems. In Proceedings of the Eihgth Int. Colloquium on Automata, Languages and Programming, pages 448\u2013458, Acre, Israel, 1981."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243\u2013309. North-Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(85)90089-1","volume":"37","author":"J. Gallier","year":"1985","unstructured":"J. Gallier and R. Book. Reductions in tree replacement systems. Theorical Computer Science, 37:123\u2013150, 1985.","journal-title":"Theorical Computer Science"},{"key":"28_CR9","volume-title":"Tree Automata","author":"M. G\u00e9cseg","year":"1984","unstructured":"M. G\u00e9cseg and M. Steinby. Tree Automata. Akademia Kiad\u00f3, Budapest, 1984."},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM, 27(4):797\u2013821, Oct. 1980.","journal-title":"J. ACM"},{"key":"28_CR11","unstructured":"G. Huet. Formal structures for computation and deduction. In: Working material for the International Summer School on Logic of Programming and Calculi of Discrete Design, Marktoberdorf, May 1986."},{"key":"28_CR12","unstructured":"G. Huet and D. S. Lankford. On the uniform halting problem for term rewriting systems. Research Report 283, INRIA, Mar. 1978."},{"key":"28_CR13","unstructured":"G. Huet and J.-J. L\u00e9vy. Computations in orthogonal term rewriting systems. In G. Plotkin and J.-L. Lassez, editors, Computational Logic: essays in Honour of Alan Robinson. MIT Press, 1990."},{"key":"28_CR14","unstructured":"G. Huet and J.-J. L\u00e9vy. Call by need computations in non-ambiguous linear term rewriting systems. In J.-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991."},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","volume":"12","author":"J. W. Klop","year":"1991","unstructured":"J. W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewriting systems. Journal of Symbolic Computation, 12:161\u2013195, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"28_CR16","unstructured":"T. Nagaya, M. Sakai, and Y. Toyama. NVNF-sequentiality of left-linear term rewriting systems. In Proc. Japanese Workhop on Term Rewriting, Kyoto, July 1995."},{"key":"28_CR17","unstructured":"M. Oyamaguchi. The reachability problem for quasi-ground term rewriting systems. J. Inf. Process., pages 232\u2013236, 1986."},{"key":"28_CR18","first-page":"718","volume":"E73","author":"M. Oyamaguchi","year":"1990","unstructured":"M. Oyamaguchi. On the word problem for right-ground term rewriting systems. Trans. IEICE Japan, E73:718\u2013723, 1990.","journal-title":"Trans. IEICE Japan"},{"issue":"1","key":"28_CR19","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1137\/0222010","volume":"22","author":"M. Oyamaguchi","year":"1993","unstructured":"M. Oyamaguchi. NV-sequentiality: a decidable condition for call-by-need computations in term rewriting systems. SIAM J. Comput., 22(1):114\u2013135, 1993.","journal-title":"SIAM J. Comput."},{"key":"28_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2267170","volume":"13","author":"E. L. Post","year":"1947","unstructured":"E. L. Post. Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 13:1\u201311, 1947.","journal-title":"Journal of Symbolic Logic"},{"key":"28_CR21","volume-title":"Th\u00e8se de doctorat","author":"W. Sadfi","year":"1993","unstructured":"W. Sadfi. Contribution \u00e0 l'\u00e9tude de la s\u00e9quentialit\u00e9 forte des d\u00e9finitions de fonctions par r\u00e8gles. Th\u00e8se de doctorat, Universit\u00e9 Paris-Sud, Orsay, France, Dec. 1993."},{"issue":"D","key":"28_CR22","first-page":"1177","volume":"J66","author":"A. Togashi","year":"1983","unstructured":"A. Togashi and S. Noguchi. Some decision problems and their time complexity for term rewriting systems. Trans. IECE Japan, J66(D):1177\u20131184, 1983.","journal-title":"Trans. IECE Japan"},{"key":"28_CR23","unstructured":"Y. Toyama. Strong sequentially of left linear overlapping term rewriting systems. In Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, CA, 1992."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:32:11Z","timestamp":1619573531000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}