Monoids Given by Rewrite Systems
- Introduction
- Construction of a Rewrite Monoid
- Basic Operations
- Accessing Monoid Information
M . i: MonRWS, RngIntElt → MonRWSEltGenerators(M): MonRWS → [ MonRWSElt]NumberOfGenerators(M): MonRWS → RngIntEltNgens(M): MonRWS → RngIntEltRelations(M): MonRWS → [MonFPRel]NumberOfRelations(M): MonRWS → RngIntEltNrels(M): MonRWS → RngIntEltOrdering(M): MonRWS → StringParent(w): MonRWSElt → MonRWS- Example: Accessing Rewrite Monoid Information
- Properties of a Rewrite Monoid
- Construction of a Word
- Arithmetic with Words
u * v: MonRWSElt, MonRWSElt → MonRWSEltu ^ n: MonRWSElt, RngIntElt → MonRWSEltu eq v: MonRWSElt, MonRWSElt → BoolEltu ne v: MonRWSElt, MonRWSElt → BoolEltIsId(w): MonRWSElt → BoolEltIsIdentity(w): MonRWSElt → BoolElt# u: MonRWSElt → RngIntEltElementToSequence(u): MonRWSElt → [ RngIntElt ]Eltseq(u): MonRWSElt → [ RngIntElt ]- Example: Word Arithmetic in a Fibonacci Monoid
- Accessing Monoid Information
- Homomorphisms
- Set Operations
Random(M, n): MonRWS, RngIntElt → MonRWSEltRandom(M): MonRWS → MonRWSEltRepresentative(M): MonRWS → MonRWSEltRep(M): MonRWS → MonRWSEltSet(M, a, b): MonRWS, RngIntElt, RngIntElt → SetEnumSet(M): MonRWS → SetEnumSeq(M, a, b): MonRWS, RngIntElt, RngIntElt → SeqEnumSeq(M): MonRWS → SeqEnum- Example: Element Sets of a Rewrite Monoid
- Conversion to a Finitely Presented Monoid
- Bibliography