#7361 ⟨a, b, c | ab=1, abba=cc⟩

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 ⇒ 1 [1]
2. c2 ⇒ ba [2]
3. cba ⇒ bac [3]
4. bacb ⇒ cb [4]
# abc:ab=1,abba=cc abc - -
ab=1
cc=ba
cba=bac
bacb=cb

Isomorphic instances

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

4 total

Σ#PresentationMapping
87392⟨a, b, c | ab=1, abcc=ba⟩φ(a) = a, φ(b) = b, φ(c) = c
87474⟨a, b, c | ab=1, baba=cc⟩φ(a) = a, φ(b) = b, φ(c) = c
87586⟨a, b, c | ab=1, cabc=ba⟩φ(a) = a, φ(b) = b, φ(c) = c
87809⟨a, b, c | ab=1, bcc=bba⟩φ(a) = a, φ(b) = b, φ(c) = c