Algorithms and reductions for rewriting problems

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

Volumn 1379, Issue , 1998, Pages 166-180

  Verma, Rakesh M ^a   Rusinowitch, Michael ^b   Lugiez, Denis ^c  

^a UNIVERSITY OF HOUSTON   (United States)

^b INRIA   (France)

^c UNIVERSITÉ DE PROVENCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION;

DECISION PROBLEMS; EQUATIONAL THEORY; POLYNOMIAL-TIME ALGORITHMS; POLYNOMIAL-TIME REDUCTION; REWRITE SYSTEMS; SEMI-THUE SYSTEM; STRING REWRITING; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY;

EID: 0011248789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052369     Document Type: Conference Paper

References (17)

1. G. Bauer and F. Otto. Finite complete rewriting systems and the complexity of the word problem. Acta Informatica, 21:521-540, 1984.
2. R. Book and F. Otto. String Rewriting Systems Springer-Verlag, 1992.
3. M. Dauchet, T. Heuillard, P. Lescanne, and S. Tison. Decidability of the confluence of finite ground term rewrite systems. Info. & Comp., 88:187-201, 1990.
4. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc. LICS, 1990.
5. N. Dershowitz and J.P. Jouannaud. Rewrite systems. In Handbook of Theoretical Computer Science, volume 2, chapter 6. North-Holland, 1990.
6. A. Deruyver and R. Gilleron. The reachability problem for ground TRS and some extensions. In Lecture Notes in Computer Science, volume 351, pages 227-243, 1989.
7. P.J. Downey, R. Sethi, and R.E. Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758-771, 1980.
8. D.F. Escrig and C. Johnen. Decidability of home space property. Tech. Rep. 503, LRI, Universitè de Paris Sud (Fr.), July 1989.
9. J.W. Klop. Rewrite systems. In H'book of Logic in Computer Science. Oxford, 1992.
10. D. Kozen. Complexity of finitely presented algebras. In Proc. Ninth ACM Symposium on Theory of Computing, pages 164-177, 1977.
11. P. Narendran and F. Otto. The word matching problem is undecidable for finite special confluent string rewriting systems. In Proc. ICALP, 1997.
12. E. W. Mayr and A. R. Meyer. The complexity of the word problem for commutative semigroups and polynomial ideals. Adv. in Mathematics, 46:305-329, 1982.
13. G. Nelson and D.C. Oppen. Fast decision algorithms based on congruence closure. Journal of the ACM, 27:356-364, 1980. Also in the 18th IEEE FOCS, 1977.
14. M. Oyamaguchi. The church rosser property for ground term rewriting systems is decidable. Theoretical Computer Science, 49:43-79, 1987.
15. M. Oyamaguchi. The reachability and joinability problems for right-ground term rewriting systems. Journal of Information Processing, 13(3):347-354, 1990.
16. M. Oyamaguchi. On the word problem for right-ground term-rewriting systems. Trans. IEICE Japam E73, 1990.
17. D.A. Plaisted. Polynomial time termination and constraint satisfaction tests. In Proc. Conf. on Rewriting Techniques & Applications, 1993.