Search

• < Previous
• 1
• Next >

---

A Categorical Approach to Syntactic Monoids

Jiří Adamek ; Stefan Milius ; Henning Urbat.

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&nbsp;[&hellip;]

---

Algebraic cocompleteness and finitary functors

Jiří Adámek.

A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial algebra and terminal coalgebra are proved to carry a&nbsp;[&hellip;]

---