#1086 ⟨a, b, c | aa=1, abccb=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. a2 ⇒ 1 [1]
2. c2ba ⇒ abc2 [6]
3. babc ⇒ cbab [9]
4. bc2a ⇒ ac2b [4]
5. bc2b ⇒ a [3]
# abc:aa=1,abccb=1 acb - -
aa=1
ccba=abcc
babc=cbab
bcca=accb
bccb=a

Isomorphic instances

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

5 total

Σ#PresentationMapping
71099⟨a, b, c | aa=1, baccb=1⟩φ(a) = abccabcccbabcbab, φ(b) = b, φ(c) = c
71111⟨a, b, c | aa=1, bcacb=1⟩φ(a) = cbababccabcccbab, φ(b) = b, φ(c) = c
71272⟨a, b, c | aa=1, bccb=a⟩φ(a) = abcccbabcbababcc, φ(b) = abcc, φ(c) = cbab
82246⟨a, b, c | abab=1, bcac=1⟩φ(a) = cbababccabcc, φ(b) = cbab, φ(c) = bc
82528⟨a, b, c | aab=c, bcbc=1⟩φ(a) = b, φ(b) = abccabcccbab, φ(c) = cbab