#19669 ⟨a, b | aba=a, ababb=aa⟩

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. aba ⇒ a [1]
2. ab2 ⇒ a2 [2]
# ab:aba=a,ababb=aa ab - -
aba=a
abb=aa

Isomorphic instances

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

2 total

Σ#PresentationMapping
1120193⟨a, b | aba=a, aaba=abb⟩φ(a) = a, φ(b) = b
1120238⟨a, b | aba=a, babb=baa⟩φ(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
1120196⟨a, b | aba=a, aaba=bba⟩φ(a) = a, φ(b) = b