Syntactic monoid

In mathematics and computer science, the syntactic monoid${\displaystyle M(L)}$ of a formal language${\displaystyle L}$ is the minimal monoid that recognizes the language ${\displaystyle L}$. By the Myhill–Nerode theorem, the syntactic monoid is unique up to unique isomorphism.