A Categorical Approach to Syntactic Monoids

TL;DR

This paper generalizes the concept of syntactic monoids to a categorical framework, unifying various algebraic structures used in language theory and providing new characterizations of regular languages.

Contribution

It introduces a categorical approach to syntactic monoids, encompassing multiple known notions and establishing their construction and properties within a unified framework.

Findings

Syntactic $\\mathcal D$-monoids can be constructed as quotients of free monoids.

These monoids are isomorphic to transition monoids of minimal automata in $\mathcal D$.

Regular languages are characterized by finite syntactic $\mathcal D$-monoids.

Abstract

The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and Scott ($\mathcal D=$ sets), the syntactic ordered monoids of Pin ($\mathcal D =$ posets), the syntactic semirings of Pol\'ak ($\mathcal D=$ semilattices), and the syntactic associative algebras of Reutenauer ($\mathcal D$ = vector spaces). Assuming that $\mathcal D$ is a commutative variety of algebras or ordered algebras, we prove that the syntactic $\mathcal D$-monoid of a language $L$ can be constructed as a quotient of a free $\mathcal D$-monoid modulo the syntactic congruence of $L$, and that it is isomorphic to the transition $\mathcal D$-monoid of the minimal automaton for $L$ in $\mathcal D$. Furthermore, in the case where the variety $\mathcal D$ is locally finite, we characterize the regular languages as precisely the languages with finite syntactic $\mathcal D$-monoids.