In mathematics and computer science, the syntactic monoid M ( L ) {\displaystyle M(L)} of a formal language L {\displaystyle L} is the minimal monoid that recognizes the language L {\displaystyle L} . By the Myhill–Nerode theorem, the syntactic monoid is unique up to unique isomorphism.
In mathematics and computer science, the syntactic monoid M ( L ) {\displaystyle M(L)} of a formal language L {\displaystyle L} is the minimal monoid that recognizes the language L {\displaystyle L} . By the Myhill–Nerode theorem, the syntactic monoid is unique up to unique isomorphism.
Source: Wikipedia "Syntactic monoid" · CC BY-SA 4.0
Share this article: X · Bluesky