#19 ⟨a, b, c | aa=1, bac=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. bac ⇒ 1 [2]
# abc:aa=1,bac=1 abc - -
aa=1
bac=1

Isomorphic instances

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

8 total

Σ#PresentationMapping
7305⟨a, b, c | aab=b, bac=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71066⟨a, b, c | aa=1, aabac=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71073⟨a, b, c | aa=1, abaca=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71088⟨a, b, c | aa=1, baaac=1⟩φ(a) = a, φ(b) = b, φ(c) = c
71232⟨a, b, c | aa=1, abac=a⟩φ(a) = a, φ(b) = b, φ(c) = c
71411⟨a, b, c | aa=1, bac=aa⟩φ(a) = a, φ(b) = b, φ(c) = c
84025⟨a, b, c | abc=1, abcbb=1⟩φ(a) = b, φ(b) = a, φ(c) = c
84059⟨a, b, c | abc=1, babcb=1⟩φ(a) = b, φ(b) = a, φ(c) = c