Decidable approximations of term rewriting systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1103, Issue , 1996, Pages 362-376

  Jacquemard, Florent ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EQUATIONAL THEORY; FINITE TREE AUTOMATON; LINEAR TERMS; REWRITE SYSTEMS; RIGHT-HAND SIDES; SEQUENTIALITY; TERM REWRITING SYSTEMS; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 84957626754     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61464-8_65     Document Type: Conference Paper

References (23)

1. H. Comon. Sequentiality, second-order monadic logic and tree automata. In Tenth Annual IEEE Symposium on Logic in Computer Science, San Diego, CA, June 1994. IEEE Comp. Soc. Press.
2. 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.
3. 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.
4. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, 1990.
5. M. Dauchet, S. Tison, T. Heuillard, and P. Lescanne. Decidability of the confluence of ground term rewriting systems. Technical Report IT-102, LIFL, Université de Lille, May 1987. Actes de logic in Computer Science Second Annual Conference New-York Juin 87.
6. N. Dershowitz. Termination of linear rewriting systems. In Proceedings of the Eihgth Int. Colloquium on Automata, Languages and Programming, pages 448-458, Acre, Israel, 1981.
7. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243-309. North- Holland, 1990.
8. J. Gallier and R. Book. Reductions in tree replacement systems. Theorical Computer Science, 37:123-150, 1985.
9. M. Gécseg and M. Steinby. Tree Automata. Akademia Kiadó, Budapest, 1984.
10. G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM, 27(4):797-821, Oct. 1980.
11. 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.
12. G. Huet and D. S. Lankford. On the uniform halting problem for term rewriting systems. Research Report 283, INRIA, Mar. 1978.
13. G. Huet and J.-J. Lévy. 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.
14. G. Huet and J.-J. Lévy. 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.
15. J. W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewriting systems. Journal of Symbolic Computation, 12:161-195, 1991.
16. 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.
17. M. Oyamaguchi. The reachability problem for quasi-ground term rewriting systems. J. Inf. Process., pages 232-236, 1986.
18. M. Oyamaguchi. On the word problem for right-ground term rewriting systems. Trans. IEICE Japan, E73:718-723, 1990.
19. M. Oyamaguchi. NV-sequentiality: a decidable condition for call-by-need computations in term rewriting systems. SIAM J. Comput., 22(1):114-135, 1993.
20. E. L. Post. Recursive unsolvability of a problem of Thue. Journal of Symbolic Logic, 13:1-11, 1947.
21. W. Sadfi. Contribution à l'étude de la séquentialité forte des definitions de fonctions par regies. Thèse de doctorat, Université Paris-Sud, Orsay, France, Dec. 1993.
22. A. Togashi and S. Noguchi. Some decision problems and their time complexity for term rewriting systems. Trans. IECE Japan, 166(D):1177-1184, 1983.
23. Y. Toyama. Strong sequentiality of left linear overlapping term rewriting systems. In Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, CA, 1992.