#27649 ⟨a, b | aa=1, ababba=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. b3a ⇒ abab2 [4]
3. bab2a ⇒ ab3 [3]
4. b(ba)2b2 ⇒ (ab)3b2 [5]
5. (ba)3b2 ⇒ ab2ab3 [7]
# ab:aa=1,ababba=bbb reversed:a/b - -
aa=1
bbba=ababb
babba=abbb
bbababb=abababbb
babababb=abbabbb

Isomorphic instances

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

2 total

Σ#PresentationMapping
1128180⟨a, b | aa=1, ababb=bbba⟩φ(a) = a, φ(b) = b
1128206⟨a, b | aa=1, abbba=babb⟩φ(a) = a, φ(b) = b

Anti-isomorphic instances

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

1 total

Σ#PresentationMapping
1128196⟨a, b | aa=1, abbab=bbba⟩φ(a) = a, φ(b) = b