#945 ⟨a, b, c | ab=a, aac=a⟩

Contents

  1. Properties
  2. Rewriting system
  3. Isomorphic instances

Properties

Rewriting system

Format:
Word:
Enter a word above to compute its normal form. Tips:
  • Lowercase letters stand for generators.
  • Spaces are ignored.
  • Numbers repeat the previous letter, e.g. b90.
Strategy:
Result: 1
1
#RuleProof
1. ab ⇒ a [1]
2. a2c ⇒ a [2]
# abc:ab=a,aac=a abc - -
ab=a
aac=a

Isomorphic instances

The mapping is from the listed presentation's alphabet to the current rewriting system's alphabet.

3 total

Σ#PresentationMapping
85281⟨a, b, c | ab=a, aabc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
85295⟨a, b, c | ab=a, abac=a⟩φ(a) = a, φ(b) = b, φ(c) = c
85787⟨a, b, c | ab=a, aac=ab⟩φ(a) = a, φ(b) = b, φ(c) = c