#3659 ⟨a, b | aa=1, abbb=bbb⟩

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. ab3 ⇒ b3 [2]
# ab:aa=1,abbb=bbb ab - -
aa=1
abbb=bbb

Isomorphic instances

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

5 total

Σ#PresentationMapping
1127557⟨a, b | aa=1, aaabbb=bbb⟩φ(a) = a, φ(b) = b
1127633⟨a, b | aa=1, abaabb=bbb⟩φ(a) = a, φ(b) = b
1127665⟨a, b | aa=1, abbaab=bbb⟩φ(a) = a, φ(b) = b
1128131⟨a, b | aa=1, aabbb=abbb⟩φ(a) = a, φ(b) = b
1128241⟨a, b | aa=1, baabb=abbb⟩φ(a) = a, φ(b) = b

Anti-isomorphic instances

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

4 total

Σ#PresentationMapping
1127603⟨a, b | aa=1, aabbba=bbb⟩φ(a) = a, φ(b) = b
1128138⟨a, b | aa=1, aabbb=bbba⟩φ(a) = a, φ(b) = b
1128204⟨a, b | aa=1, abbba=abbb⟩φ(a) = a, φ(b) = b
1128248⟨a, b | aa=1, baabb=bbba⟩φ(a) = a, φ(b) = b