#103 ⟨a, b, c | ab=a, acb=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. acb ⇒ 1 [2]
# abc:ab=a,acb=1 abc - -
ab=a
acb=1

Isomorphic instances

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

4 total

Σ#PresentationMapping
7783⟨a, b, c | ab=a, abcb=1⟩φ(a) = a, φ(b) = b, φ(c) = c
81797⟨a, b, c | aba=aa, acb=1⟩φ(a) = a, φ(b) = b, φ(c) = c
81813⟨a, b, c | aba=ab, bca=1⟩φ(a) = b, φ(b) = a, φ(c) = c
84799⟨a, b, c | ab=a, abbcb=1⟩φ(a) = a, φ(b) = b, φ(c) = c