#3405 ⟨a, b | aa=1, bbabbb=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. b2ab ⇒ bab2 [6]
3. bab4 ⇒ b [4]
# ab:aa=1,bbabbb=b ab - -
aa=1
bbab=babb
babbbb=b

Isomorphic instances

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

10 total

Σ#PresentationMapping
1126541⟨a, b | aa=1, aabbabbb=b⟩φ(a) = a, φ(b) = b
1126547⟨a, b | aa=1, aabbbabb=b⟩φ(a) = a, φ(b) = b
1126661⟨a, b | aa=1, baababbb=b⟩φ(a) = a, φ(b) = b
1126665⟨a, b | aa=1, baabbabb=b⟩φ(a) = a, φ(b) = b
1126695⟨a, b | aa=1, bbaaabbb=b⟩φ(a) = a, φ(b) = b
1126697⟨a, b | aa=1, bbaababb=b⟩φ(a) = a, φ(b) = b
1127146⟨a, b | aa=1, abbabbb=ab⟩φ(a) = a, φ(b) = b
1127154⟨a, b | aa=1, abbbabb=ab⟩φ(a) = a, φ(b) = b
1127755⟨a, b | aa=1, bbabbb=aab⟩φ(a) = a, φ(b) = b
1127758⟨a, b | aa=1, bbabbb=baa⟩φ(a) = a, φ(b) = b