#95 ⟨a, b | aa=1, bbb=b⟩

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

Isomorphic instances

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

23 total

Σ#PresentationMapping
81111⟨a, b | aa=1, aabbb=b⟩φ(a) = a, φ(b) = b
81127⟨a, b | aa=1, baabb=b⟩φ(a) = a, φ(b) = b
81191⟨a, b | aa=1, abbb=ab⟩φ(a) = a, φ(b) = b
81254⟨a, b | aa=1, bbb=aab⟩φ(a) = a, φ(b) = b
109671⟨a, b | aa=1, aaaabbb=b⟩φ(a) = a, φ(b) = b
109693⟨a, b | aa=1, aabaabb=b⟩φ(a) = a, φ(b) = b
109703⟨a, b | aa=1, aabbaab=b⟩φ(a) = a, φ(b) = b
109709⟨a, b | aa=1, aabbbaa=b⟩φ(a) = a, φ(b) = b
109763⟨a, b | aa=1, baaaabb=b⟩φ(a) = a, φ(b) = b
109769⟨a, b | aa=1, baabaab=b⟩φ(a) = a, φ(b) = b
109956⟨a, b | aa=1, aaabbb=ab⟩φ(a) = a, φ(b) = b
109980⟨a, b | aa=1, aabbba=ba⟩φ(a) = a, φ(b) = b
109994⟨a, b | aa=1, abaabb=ab⟩φ(a) = a, φ(b) = b
1010010⟨a, b | aa=1, abbaab=ab⟩φ(a) = a, φ(b) = b
1010213⟨a, b | aa=1, aaaab=bbb⟩φ(a) = a, φ(b) = b
1010235⟨a, b | aa=1, aabaa=bbb⟩φ(a) = a, φ(b) = b
1010253⟨a, b | aa=1, aabbb=aab⟩φ(a) = a, φ(b) = b
1010256⟨a, b | aa=1, aabbb=baa⟩φ(a) = a, φ(b) = b
1010292⟨a, b | aa=1, abbba=aba⟩φ(a) = a, φ(b) = b
1010311⟨a, b | aa=1, baabb=aab⟩φ(a) = a, φ(b) = b
1010314⟨a, b | aa=1, baabb=baa⟩φ(a) = a, φ(b) = b
1010492⟨a, b | aa=1, abbb=aaab⟩φ(a) = a, φ(b) = b
1010495⟨a, b | aa=1, abbb=abaa⟩φ(a) = a, φ(b) = b