#1131 ⟨a, b | aa=1, babbb=b⟩

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 ⇒ b [2]
# ab:aa=1,babbb=b ab - -
aa=1
babbb=b

Isomorphic instances

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

6 total

Σ#PresentationMapping
109701⟨a, b | aa=1, aababbb=b⟩φ(a) = a, φ(b) = b
109767⟨a, b | aa=1, baaabbb=b⟩φ(a) = a, φ(b) = b
109777⟨a, b | aa=1, babaabb=b⟩φ(a) = a, φ(b) = b
1010006⟨a, b | aa=1, ababbb=ab⟩φ(a) = a, φ(b) = b
1010325⟨a, b | aa=1, babbb=aab⟩φ(a) = a, φ(b) = b
1010328⟨a, b | aa=1, babbb=baa⟩φ(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
109711⟨a, b | aa=1, aabbbab=b⟩φ(a) = a, φ(b) = b
109773⟨a, b | aa=1, baabbab=b⟩φ(a) = a, φ(b) = b
1010018⟨a, b | aa=1, abbbab=ab⟩φ(a) = a, φ(b) = b