#252 ⟨a, b, c | ab=1, bca=c⟩

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. bd ⇒ c [9]
2. db ⇒ c [7]
3. ab ⇒ 1 [1]
4. ad ⇒ da [6]
5. ac ⇒ d [3]
6. cb ⇒ bc [5]
7. cd ⇒ dc [8]
8. ca ⇒ d [4]
# abc:ab=1,bca=c bdac ac=d morph:2/1
bd=c
db=c
ab=1
ad=da
ac=d
cb=bc
cd=dc
ca=d

Isomorphic instances

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

4 total

Σ#PresentationMapping
86871⟨a, b, c | ab=1, abbca=c⟩φ(a) = a, φ(b) = b, φ(c) = c
86983⟨a, b, c | ab=1, babca=c⟩φ(a) = a, φ(b) = b, φ(c) = c
87528⟨a, b, c | ab=1, bbca=bc⟩φ(a) = a, φ(b) = b, φ(c) = c
87784⟨a, b, c | ab=1, bca=abc⟩φ(a) = a, φ(b) = b, φ(c) = c