Special rewriting system

From Groupprops

Template:Rewriting system property

Definition

Symbol-free definition

A rewriting system is said to be special if all the rewrites have the empty word on the right side.

Note that though the term is used in the general context for rewriting system of a monoid, it can also be viewed in the context of a rewriting system for a group. Since the group rewrites () all have the empty word on the right side, the rewriting system for a group is special if and only if the rewriting system for the corresponding monoid is.

Relation with other properties

Weaker properties

Metaproperties

Local testability

This property of a rewriting system is locally testable, in other words, it can be reduced to testing a particular property for each rewrite in the system

The property of being a special rewriting system can be described in terms of a certain property (right side being trivial) being true for each rewrite.

Free product-closedness

This property of a rewriting system is free product-closed. In other words, if we have two rewriting systems satisfying the property, the natural free product of these rewriting systems also satisfies the property

A free product of special rewriting systems is a special rewriting system. This follows from the local testability and from other facts.