A Categorical Approach to Syntactic Monoids
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 synt...
Main Authors: | Jiří Adamek, Stefan Milius, Henning Urbat |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2018-05-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/4436/pdf |
Similar Items
-
Corecursive Algebras, Corecursive Monads and Bloom Monads
by: Jiří Adámek, et al.
Published: (2014-09-01) -
Monoidal Width
by: Elena Di Lavore, et al.
Published: (2023-09-01) -
Semantics of Higher-Order Recursion Schemes
by: Jiri Adamek, et al.
Published: (2011-04-01) -
Well-Pointed Coalgebras
by: Jiří Adámek, et al.
Published: (2013-08-01) -
Elgot Algebras
by: Jiri Adamek, et al.
Published: (2006-11-01)