#34 ⟨a, b, c | ab=aa, bc=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 ⇒ a2 [1]
2. bc ⇒ 1 [2]
3. a2c ⇒ a [3]
# abc:ab=aa,bc=1 abc - -
ab=aa
bc=1
aac=a

Isomorphic instances

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

3 total

Σ#PresentationMapping
87379⟨a, b, c | ab=1, abca=cc⟩φ(a) = b, φ(b) = c, φ(c) = a
87395⟨a, b, c | ab=1, abcc=ca⟩φ(a) = b, φ(b) = c, φ(c) = a
87812⟨a, b, c | ab=1, bcc=bca⟩φ(a) = b, φ(b) = c, φ(c) = a