#231 ⟨a, b, c | ab=1, aac=c⟩

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 ⇒ c [2]
# abc:ab=1,aac=c abc - -
ab=1
aac=c

Isomorphic instances

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

8 total

Σ#PresentationMapping
86789⟨a, b, c | ab=1, aaabc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86803⟨a, b, c | ab=1, aabac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86822⟨a, b, c | ab=1, aacab=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86847⟨a, b, c | ab=1, abaac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87319⟨a, b, c | ab=1, aaca=ca⟩φ(a) = a, φ(b) = b, φ(c) = c
87468⟨a, b, c | ab=1, baac=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87713⟨a, b, c | ab=1, abc=aac⟩φ(a) = a, φ(b) = b, φ(c) = c
87820⟨a, b, c | ab=1, cab=aac⟩φ(a) = a, φ(b) = b, φ(c) = c