#6154 ⟨a, b, c | aa=1, abaccb=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. bad ⇒ dba [8]
3. dbab ⇒ a [9]
4. cd ⇒ dc [5]
5. cbab ⇒ (ba)2ca [12]
6. c2 ⇒ d [3]
# abc:aa=1,abaccb=1 reversed:bad/c cc=d morph:2/0
aa=1
bad=dba
dbab=a
cd=dc
cbab=babaca
cc=d

Isomorphic instances

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

1 total

Σ#PresentationMapping
86732⟨a, b, c | aa=1, baccb=a⟩φ(a) = a, φ(b) = b, φ(c) = c