1 problem

Let $T_n$ be the full transformation monoid on an $n$-element set, and let $U_{k,l}$ be the monoid defined above. For a language $L$ over an alphabet of size $2$, write…