\begin{definition}{Monoid of Strings}{•}
Let $X$ be a set. We call this an \textbf{alphabet}. The free monoid $F_M(X)$ is the \textbf{monoid of strings} in the alphabet $X$. Any $L \subseteq F_M(X)$ is called a \textbf{language}.
\end{definition}
\begin{defframe}
It seems like the free monoid is the natural home of strings, since you want to be able to concatenate strings (multiply them) and you want an empty string (the identity)
\end{defframe}