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

Isomorphic instances

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

5 total

Σ#PresentationMapping
1127581⟨a, b | aa=1, aababb=bbb⟩φ(a) = a, φ(b) = b
1127709⟨a, b | aa=1, baaabb=bbb⟩φ(a) = a, φ(b) = b
1128135⟨a, b | aa=1, aabbb=babb⟩φ(a) = a, φ(b) = b
1128173⟨a, b | aa=1, ababb=abbb⟩φ(a) = a, φ(b) = b
1128245⟨a, b | aa=1, baabb=babb⟩φ(a) = a, φ(b) = b

Anti-isomorphic instances

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

5 total

Σ#PresentationMapping
1127595⟨a, b | aa=1, aabbab=bbb⟩φ(a) = a, φ(b) = b
1127717⟨a, b | aa=1, baabab=bbb⟩φ(a) = a, φ(b) = b
1128137⟨a, b | aa=1, aabbb=bbab⟩φ(a) = a, φ(b) = b
1128189⟨a, b | aa=1, abbab=abbb⟩φ(a) = a, φ(b) = b
1128247⟨a, b | aa=1, baabb=bbab⟩φ(a) = a, φ(b) = b