#983 ⟨a, b, c | ab=a, caa=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. cb ⇒ c [3]
3. ca2 ⇒ c [2]
# abc:ab=a,caa=c abc - -
ab=a
cb=c
caa=c

Isomorphic instances

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

3 total

Σ#PresentationMapping
85409⟨a, b, c | ab=a, caab=c⟩φ(a) = a, φ(b) = b, φ(c) = c
85415⟨a, b, c | ab=a, caba=c⟩φ(a) = a, φ(b) = b, φ(c) = c
85433⟨a, b, c | ab=a, cbaa=c⟩φ(a) = a, φ(b) = b, φ(c) = c