Using groups for investigating rewrite systems

Patrick Dehornoy,V. V. Oostrom

Published 2006 in Mathematical Structures in Computer Science

ABSTRACT

We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist of introducing a monoid of partial maps, listing the monoid relations corresponding to the local confluence diagrams of the rewrite system, introducing the group presented by these relations, and, finally, replacing the initial rewrite system with an internal process entirely sitting in this group. When the approach can be completed, one typically obtains a practical method for constructing algebras satisfying prescribed equations and for solving the associated word problem. The above techniques have been developed by the first author in a context of general algebra. The goal of this paper is to bring them to the attention of the rewrite system community. We hope that these techniques may be useful for more general rewrite systems.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-34 of 34 references · Page 1 of 1