#986 ⟨a, b, c | ab=a, cab=c⟩

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. ab ⇒ a [1]
2. ca ⇒ c [2]
3. cb ⇒ c [3]
# abc:ab=a,cab=c abc - -
ab=a
ca=c
cb=c

Isomorphic instances

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

4 total

Σ#PresentationMapping
7992⟨a, b, c | ab=a, cba=c⟩φ(a) = a, φ(b) = b, φ(c) = c
85418⟨a, b, c | ab=a, cabb=c⟩φ(a) = a, φ(b) = b, φ(c) = c
85436⟨a, b, c | ab=a, cbab=c⟩φ(a) = a, φ(b) = b, φ(c) = c
85442⟨a, b, c | ab=a, cbba=c⟩φ(a) = a, φ(b) = b, φ(c) = c