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

Isomorphic instances

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

7 total

Σ#PresentationMapping
82441⟨a, b, c | aab=b, bbcc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86128⟨a, b, c | aa=1, aabbcc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86170⟨a, b, c | aa=1, abbcca=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86200⟨a, b, c | aa=1, baabcc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86236⟨a, b, c | aa=1, bbaacc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
86672⟨a, b, c | aa=1, abbcc=a⟩φ(a) = a, φ(b) = b, φ(c) = c
87259⟨a, b, c | aa=1, bbcc=aa⟩φ(a) = a, φ(b) = b, φ(c) = c