#229 ⟨a, b, c | ab=1, 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 ⇒ 1 [1]
2. a2c ⇒ a [2]
# abc:ab=1,aac=a abc - -
ab=1
aac=a

Isomorphic instances

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

9 total

Σ#PresentationMapping
82349⟨a, b, c | aab=a, aabc=1⟩φ(a) = a, φ(b) = c, φ(c) = b
86787⟨a, b, c | ab=1, aaabc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
86801⟨a, b, c | ab=1, aabac=a⟩φ(a) = a, φ(b) = b, φ(c) = c
86820⟨a, b, c | ab=1, aacab=a⟩φ(a) = a, φ(b) = b, φ(c) = c
86845⟨a, b, c | ab=1, abaac=a⟩φ(a) = a, φ(b) = b, φ(c) = c
87313⟨a, b, c | ab=1, aaca=aa⟩φ(a) = a, φ(b) = b, φ(c) = c
87466⟨a, b, c | ab=1, baac=ba⟩φ(a) = a, φ(b) = b, φ(c) = c
87708⟨a, b, c | ab=1, aac=aab⟩φ(a) = a, φ(b) = b, φ(c) = c
87709⟨a, b, c | ab=1, aba=aac⟩φ(a) = a, φ(b) = b, φ(c) = c