#115 ⟨a, b, c | ab=a, cbc=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. ab ⇒ a [1]
2. cb ⇒ bc [3]
3. ac2 ⇒ a [5]
4. bc2 ⇒ 1 [4]
# abc:ab=a,cbc=1 abc - -
ab=a
cb=bc
acc=a
bcc=1

Isomorphic instances

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

2 total

Σ#PresentationMapping
81940⟨a, b, c | abc=ab, bcb=1⟩φ(a) = a, φ(b) = c, φ(c) = b
81963⟨a, b, c | abc=ac, cbc=1⟩φ(a) = a, φ(b) = b, φ(c) = c