Pages that link to "Item:Q305772"
From MaRDI portal
The following pages link to The finite basis problem for words with at most two non-linear variables. (Q305772):
Displaying 8 items.
- Non-finitely based monoids. (Q744847) (← links)
- Finitely based monoids. (Q744848) (← links)
- Classification of finitely based words in a class of words over a \(3\)-letter alphabet. (Q896250) (← links)
- Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
- On the finite basis problem for certain 2-limited words. (Q1940888) (← links)
- Finitely based sets of 2-limited block-2-simple words (Q2009667) (← links)
- LEE MONOIDS ARE NONFINITELY BASED WHILE THE SETS OF THEIR ISOTERMS ARE FINITELY BASED (Q4642352) (← links)
- Varieties of monoids with complex lattices of subvarieties (Q5135354) (← links)