Pages that link to "Item:Q3451085"
From MaRDI portal
The following pages link to Recognisable Languages over Monads (Q3451085):
Displaying 21 items.
- Algebra for trees (Q2074223) (← links)
- Iterated covariant powerset is not a monad (Q2134821) (← links)
- On language varieties without Boolean operations (Q2232259) (← links)
- Learning pomset automata (Q2233430) (← links)
- Pro-aperiodic monoids via saturated models (Q2279939) (← links)
- Whither semantics? (Q2286732) (← links)
- Codensity, profiniteness and algebras of semiring-valued measures (Q2318383) (← links)
- Syntactic structures of regular languages (Q2333830) (← links)
- A (co)algebraic theory of succinct automata (Q2423764) (← links)
- Profinite Monads, Profinite Equations, and Reiterman’s Theorem (Q2811362) (← links)
- Schützenberger Products in a Category (Q2817378) (← links)
- Generalized Eilenberg Theorem (Q4617980) (← links)
- (Q4643960) (← links)
- (Q4989401) (← links)
- Quantifiers on languages and codensity monads (Q5006459) (← links)
- Eilenberg Theorems for Free (Q5111258) (← links)
- (Q5232909) (← links)
- (Q5875342) (← links)
- (Q5875346) (← links)
- Eilenberg's variety theorem without Boolean operations (Q6186309) (← links)
- Monadic monadic second order logic (Q6612795) (← links)
