Recognisable languages over monads
From MaRDI portal
Abstract: The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of composing structures into bigger structures. It so happens that category theory has an abstract concept for this, namely a monad. The goal of this paper is to propose monads as a unifying framework for discussing existing algebras and designing new algebras.
Recommendations
Cites work
- A topological approach to recognition
- Axiomatizing the equational theory of regular tree languages
- Duality and Equational Theory of Regular Languages
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 5872386 (Why is no real title available?)
- scientific article; zbMATH DE number 176766 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 475413 (Why is no real title available?)
- scientific article; zbMATH DE number 6829362 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- Languages of profinite words and the limitedness problem
- Nominal monoids
- Regular languages of words over countable linear orderings
- Schützenberger and Eilenberg theorems for words on linear orderings
- The Birkhoff theorem for finite algebras
Cited in
(32)- Languages recognized by programs over the two-element monoid
- Algebra for trees
- Iterated covariant powerset is not a monad
- On language varieties without Boolean operations
- Learning pomset automata
- Pro-aperiodic monoids via saturated models
- Whither semantics?
- Codensity, profiniteness and algebras of semiring-valued measures
- Syntactic structures of regular languages
- A (co)algebraic theory of succinct automata
- Profinite monads, profinite equations, and Reiterman's theorem
- Schützenberger products in a category
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- scientific article; zbMATH DE number 4009834 (Why is no real title available?)
- scientific article; zbMATH DE number 1036407 (Why is no real title available?)
- Generalized Eilenberg theorem. Varieties of languages in a category
- A categorical approach to syntactic monoids
- scientific article; zbMATH DE number 7350772 (Why is no real title available?)
- Quantifiers on languages and codensity monads
- Eilenberg Theorems for Free
- Toward a uniform theory of effectful state machines
- Quantifiers on languages and codensity monads
- Regular tree languages in low levels of the Wadge hierarchy
- Monads of coalgebras: rational terms and term graphs
- From equational specifications of algebras with structure to varieties of data languages (invited paper)
- scientific article; zbMATH DE number 7649889 (Why is no real title available?)
- First-order separation over countable ordinals
- Eilenberg's variety theorem without Boolean operations
- Monadic monadic second order logic
- Extended Stone duality via monoidal adjunctions
- The right angled Artin group functor as a categorical embedding
- Semi-Galois categories. I: The classical Eilenberg variety theory
This page was built for publication: Recognisable languages over monads
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451085)
