The following pages link to Finitely based monoids. (Q744848):
Displaying 15 items.
- The finite basis problem for words with at most two non-linear variables. (Q305772) (← links)
- Non-finitely based monoids. (Q744847) (← links)
- The finite basis problem for Kiselman monoids. (Q895869) (← links)
- Finitely based sets of 2-limited block-2-simple words (Q2009667) (← links)
- (Q2754914) (← links)
- Infinite partition monoids. (Q2876611) (← links)
- Minimal non-finitely based monoids (Q3103755) (← links)
- THE FINITE BASIS PROBLEM FOR THE MONOID OF TWO-BY-TWO UPPER TRIANGULAR TROPICAL MATRICES (Q3186380) (← links)
- (Q3435568) (← links)
- LEE MONOIDS ARE NONFINITELY BASED WHILE THE SETS OF THEIR ISOTERMS ARE FINITELY BASED (Q4642352) (← links)
- Classification of limit varieties of 𝒥-trivial monoids (Q5080185) (← links)
- Finite basis problems for stalactic, taiga, sylvester and baxter monoids (Q6077349) (← links)
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups (Q6170751) (← links)
- Limit varieties generated by finite non-J-trivial aperiodic monoids (Q6186656) (← links)
- Lattices of varieties of plactic-like monoids (Q6591552) (← links)
