Recommendations
Cites work
- A Reiterman theorem for pseudovarieties of finite first-order structures
- Discrete-time machines in closed monoidal categories. I
- Duality and Equational Theory of Regular Languages
- Generalized Eilenberg theorem. I: Local varieties of languages
- scientific article; zbMATH DE number 176766 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1848285 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- Minimization via duality
- Monads on symmetric monoidal closed categories
- Profinite Methods in Automata Theory
- Recognisable languages over monads
- Series formelles et algèbres syntactiques
- Sound and complete axiomatizations of coalgebraic language equivalence
- Syntactic monoids in a category
- Tensor Products and Bimorphisms
- The dual equivalence of equations and coequations for automata
- Universal coalgebra: A theory of systems
- Varieties of Languages in a Category
- Varieties of ordered algebras
Cited in
(10)- ``Pathologies in two syntactic categories of partial maps
- Syntactic monoids and word problems.
- scientific article; zbMATH DE number 3920805 (Why is no real title available?)
- scientific article; zbMATH DE number 139630 (Why is no real title available?)
- scientific article; zbMATH DE number 522864 (Why is no real title available?)
- scientific article; zbMATH DE number 1036407 (Why is no real title available?)
- A categorical analogue of the monoid semiring construction
- Syntactic monoids in a category
- Languages for monoidal categories
- Learning bottom-up tree automata valued in monoidal categories
This page was built for publication: A categorical approach to syntactic monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643960)