Constructions of free dibands and tribands (Q2153509)

A \textit{dimonoid} is a set equipped with two binary associatiive operations \(\vdash\) and \(\dashv\) such that the following identities hold: 1) \(x\dashv (y\vdash z)=x\dashv(y\dashv z)\); 2) \((x\dashv y)\vdash z=(x\vdash y)\vdash z\); 3) \(x\vdash(y\dashv z)=(x\vdash y)\dashv z\). A set with three binary associative operations \(\vdash\), \(\dashv\) and \(\perp\) satisfying additional five identities is called a \textit{trioid}. An idempotent (with respect to all operations) dimonoid (trioid) is called a \textit{diband} (\textit{triband}). The cardinality of free dibands and free tribands generated by a finite set is calculated. Equivalence classes of a free diband and of a free triband are characterized which allows to conclude that the word problem for free dibands and free tribands is solvable.