#5219 ⟨a, b | aab=bb, bbba=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. b6 ⇒ b [6]
2. ba ⇒ b4 [7]
3. a2b ⇒ b2 [1]
# ab:aab=bb,bbba=b b/a - -
bbbbbb=b
ba=bbbb
aab=bb

Isomorphic instances

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

5 total

Σ#PresentationMapping
1114459⟨a, b | aaab=a, bbaab=a⟩φ(a) = b, φ(b) = a
1114461⟨a, b | aaab=a, bbaba=a⟩φ(a) = b, φ(b) = a
1114587⟨a, b | aaba=a, bbaab=a⟩φ(a) = b, φ(b) = a
1115750⟨a, b | aab=bb, aabba=b⟩φ(a) = a, φ(b) = b
1115774⟨a, b | aab=bb, baaba=b⟩φ(a) = a, φ(b) = b

Anti-isomorphic instances

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

2 total

Σ#PresentationMapping
1114575⟨a, b | aaba=a, baabb=a⟩φ(a) = b, φ(b) = a
1115762⟨a, b | aab=bb, abbaa=b⟩φ(a) = a, φ(b) = b