Information and Computation
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
Journal of Symbolic Computation
Information and Computation
Term rewriting and all that
Derivation trees of ground term rewriting systems
Information and Computation
Restricted ground tree transducers
Theoretical Computer Science
Decidability of confluence for ground term rewriting systems
FCT '85 Fundamentals of Computation Theory
Term rewriting restricted to ground terms
Theoretical Computer Science
Hi-index | 0.00 |
We show that it is decidable for any extended ground term rewrite system R whether there is a ground term rewrite system S such that the congrunce ↔$^*_R$ generated by R is equal to the congruence ↔$^*_S$ generated by S. If the answer is yes, then we can effectively construct such a ground term rewrite system S. We characterize congruences generated by extended ground term rewrite systems.