#27655 ⟨a, b | aa=1, ababbb=bab⟩

Quick links

Properties
Rewriting system
Isomorphic instances

Properties

Presentation has sum-of-sides 11
Infinite non-commutative monoid

Rewriting system

Format:	Pretty Plain
Word to reduce:
	Tips: Lowercase letters stand for generators. Spaces are ignored. Numbers repeat the previous letter, e.g. `b90`.
Reduction strategy:	Leftmost Rightmost
Path to normal form:	1 1

Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = 1
Certificate: derivations of all rewriting rules from the defining relations.

#	Rule	Proof
1.	bab⁵ ⇒ bab	[4]
2.	b⁶ab ⇒ b²ab	[14]
3.	a² ⇒ 1	[1]
4.	(ab)² ⇒ bab³	[3]
5.	ab⁵ab ⇒ b⁵ab³	[16]
6.	bab³ab ⇒ ab²ab³	[5]
7.	b²ab⁴ab ⇒ ab⁴ab³	[9]
8.	b(b²a)²b ⇒ (ab³)²	[11]
9.	a(b²a)²b ⇒ (b²a)²b³	[12]

# ab:aa=1,ababbb=bab b/a
babbbbb=bab
bbbbbbab=bbab
aa=1
abab=babbb
abbbbbab=bbbbbabbb
babbbab=abbabbb
bbabbbbab=abbbbabbb
bbbabbab=abbbabbb
abbabbab=bbabbabbb

Isomorphic instances

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

1 total

Σ	#	Presentation	Mapping
11	28265	⟨a, b \| aa=1, babbb=abab⟩	φ(a) = a, φ(b) = b

Up:	Monoids with two generators and two relations
Prev:	#27649 ⟨a, b \| aa=1, ababba=bbb⟩
Next:	#27657 ⟨a, b \| aa=1, ababbb=bbb⟩