#3671 ⟨a, b | aa=1, babb=bab⟩

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 ⇒ bab [2]
# ab:aa=1,babb=bab ab - -
aa=1
babb=bab

Isomorphic instances

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

5 total

Σ#PresentationMapping
1127579⟨a, b | aa=1, aababb=bab⟩φ(a) = a, φ(b) = b
1127707⟨a, b | aa=1, baaabb=bab⟩φ(a) = a, φ(b) = b
1128103⟨a, b | aa=1, aabab=babb⟩φ(a) = a, φ(b) = b
1128171⟨a, b | aa=1, ababb=abab⟩φ(a) = a, φ(b) = b
1128232⟨a, b | aa=1, baaab=babb⟩φ(a) = a, φ(b) = b

Anti-isomorphic instances

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

4 total

Σ#PresentationMapping
1127593⟨a, b | aa=1, aabbab=bab⟩φ(a) = a, φ(b) = b
1127715⟨a, b | aa=1, baabab=bab⟩φ(a) = a, φ(b) = b
1128105⟨a, b | aa=1, aabab=bbab⟩φ(a) = a, φ(b) = b
1128187⟨a, b | aa=1, abbab=abab⟩φ(a) = a, φ(b) = b