#250 ⟨a, b, c | ab=1, bbc=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. ac ⇒ bc [3]
3. b2c ⇒ c [2]
# abc:ab=1,bbc=c bac - -
ab=1
ac=bc
bbc=c

Isomorphic instances

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

7 total

Σ#PresentationMapping
86868⟨a, b, c | ab=1, abbbc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86980⟨a, b, c | ab=1, babbc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87010⟨a, b, c | ab=1, bbabc=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87019⟨a, b, c | ab=1, bbbac=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87519⟨a, b, c | ab=1, bbbc=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87529⟨a, b, c | ab=1, bbca=ca⟩φ(a) = a, φ(b) = b, φ(c) = c
87771⟨a, b, c | ab=1, bbc=abc⟩φ(a) = a, φ(b) = b, φ(c) = c