#565 ⟨a, b | aaa=a, aba=a⟩

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. a3 ⇒ a [1]
2. aba ⇒ a [2]
# ab:aaa=a,aba=a ab - -
aaa=a
aba=a

Isomorphic instances

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

7 total

Σ#PresentationMapping
106242⟨a, b | aaa=a, aaaba=a⟩φ(a) = a, φ(b) = b
106246⟨a, b | aaa=a, aabaa=a⟩φ(a) = a, φ(b) = b
106450⟨a, b | aba=a, aaaba=a⟩φ(a) = a, φ(b) = b
106454⟨a, b | aba=a, aabaa=a⟩φ(a) = a, φ(b) = b
106533⟨a, b | aaa=a, aaba=aa⟩φ(a) = a, φ(b) = b
106730⟨a, b | aba=a, aaab=ab⟩φ(a) = a, φ(b) = b
106799⟨a, b | aaa=a, aba=aaa⟩φ(a) = a, φ(b) = b