#3537 ⟨a, b | aa=1, babbb=bb⟩

Contents

  1. Properties
  2. Rewriting system
  3. Isomorphic instances
  4. Anti-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. bab3 ⇒ b2 [2]
# ab:aa=1,babbb=bb ab - -
aa=1
babbb=bb

Isomorphic instances

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

7 total

Σ#PresentationMapping
1127056⟨a, b | aa=1, aababbb=bb⟩φ(a) = a, φ(b) = b
1127182⟨a, b | aa=1, baaabbb=bb⟩φ(a) = a, φ(b) = b
1127201⟨a, b | aa=1, babaabb=bb⟩φ(a) = a, φ(b) = b
1127653⟨a, b | aa=1, ababbb=abb⟩φ(a) = a, φ(b) = b
1128263⟨a, b | aa=1, babbb=aabb⟩φ(a) = a, φ(b) = b
1128269⟨a, b | aa=1, babbb=baab⟩φ(a) = a, φ(b) = b
1128272⟨a, b | aa=1, babbb=bbaa⟩φ(a) = a, φ(b) = b

Anti-isomorphic instances

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

3 total

Σ#PresentationMapping
1127075⟨a, b | aa=1, aabbbab=bb⟩φ(a) = a, φ(b) = b
1127193⟨a, b | aa=1, baabbab=bb⟩φ(a) = a, φ(b) = b
1127677⟨a, b | aa=1, abbbab=abb⟩φ(a) = a, φ(b) = b