#4955 ⟨a, b, c | ab=a, cbccc=1⟩

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 ⇒ bc [5]
3. ac4 ⇒ a [6]
4. bc4 ⇒ 1 [4]
# abc:ab=a,cbccc=1 abc - -
ab=a
cb=bc
acccc=a
bcccc=1

Isomorphic instances

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

2 total

Σ#PresentationMapping
84973⟨a, b, c | ab=a, ccbcc=1⟩φ(a) = a, φ(b) = b, φ(c) = c
84979⟨a, b, c | ab=a, cccbc=1⟩φ(a) = a, φ(b) = b, φ(c) = c