Asian Journal of Mathematics and Computer Research

NUMBER OF EQUIVALENT REDUCED GROUND TERM REWRITING SYSTEMS

SÁNDOR VÁGVÖLGYI *

Department of Foundations of Computer Science, University of Szeged, H-6701 Szeged, P.O.Box 652, Hungary

*Author to whom correspondence should be addressed.

---

Abstract

We give a lower bound, computable in O(n³) time, on the number of reduced ground term rewriting systems equivalent to any given reduced ground term rewriting system.

Keywords: Ground term rewriting system, time complexity

---

---