#255 ⟨a, b, c | ab=1, bcc=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. ac ⇒ c2 [3]
2. ab ⇒ 1 [1]
3. bc2 ⇒ c [2]
# abc:ab=1,bcc=c cab - -
ac=cc
ab=1
bcc=c

Isomorphic instances

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

10 total

Σ#PresentationMapping
71361⟨a, b, c | ab=1, bcac=c⟩φ(a) = a, φ(b) = b, φ(c) = bc
86877⟨a, b, c | ab=1, abbcc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86986⟨a, b, c | ab=1, babcc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87016⟨a, b, c | ab=1, bbacc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87045⟨a, b, c | ab=1, bcaac=c⟩φ(a) = a, φ(b) = b, φ(c) = bbc
87048⟨a, b, c | ab=1, bcabc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87057⟨a, b, c | ab=1, bcbac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87537⟨a, b, c | ab=1, bbcc=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87802⟨a, b, c | ab=1, bcc=abc⟩φ(a) = a, φ(b) = b, φ(c) = c
87824⟨a, b, c | ab=1, cab=bcc⟩φ(a) = a, φ(b) = b, φ(c) = c