#20 ⟨a, b, c | aa=1, bbc=1⟩

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. a2 ⇒ 1 [1]
2. b2c ⇒ 1 [2]
# abc:aa=1,bbc=1 abc - -
aa=1
bbc=1

Isomorphic instances

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

9 total

Σ#PresentationMapping
7306⟨a, b, c | aab=b, bbc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71067⟨a, b, c | aa=1, aabbc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71078⟨a, b, c | aa=1, abbca=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71089⟨a, b, c | aa=1, baabc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71237⟨a, b, c | aa=1, abbc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
71420⟨a, b, c | aa=1, bbc=aa⟩φ(a) = a, φ(b) = b, φ(c) = c
83662⟨a, b, c | aab=1, aabcc=1⟩φ(a) = b, φ(b) = c, φ(c) = a
83788⟨a, b, c | aab=1, caabc=1⟩φ(a) = b, φ(b) = c, φ(c) = a
83838⟨a, b, c | aab=1, ccaab=1⟩φ(a) = b, φ(b) = c, φ(c) = a