Recognisable Languages over Monads

DOI10.1007/978-3-319-21500-6_1zbMath1434.68307arXiv1502.04898OpenAlexW1560463521MaRDI QIDQ3451085

Mikołaj Bojańczyk

Publication date: 10 November 2015

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.04898

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)

Related Items

Iterated covariant powerset is not a monad ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A (co)algebraic theory of succinct automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ First-order separation over countable ordinals ⋮ Eilenberg's variety theorem without Boolean operations ⋮ Generalized Eilenberg Theorem ⋮ On language varieties without Boolean operations ⋮ Learning pomset automata ⋮ Eilenberg Theorems for Free ⋮ Pro-aperiodic monoids via saturated models ⋮ Whither semantics? ⋮ Profinite Monads, Profinite Equations, and Reiterman’s Theorem ⋮ Schützenberger Products in a Category ⋮ Codensity, profiniteness and algebras of semiring-valued measures ⋮ Algebra for trees ⋮ Syntactic structures of regular languages ⋮ Quantifiers on languages and codensity monads ⋮ Unnamed Item

Cites Work

• Nominal monoids
• Schützenberger and Eilenberg theorems for words on linear orderings
• Axiomatizing the equational theory of regular tree languages
• The Birkhoff theorem for finite algebras
• Regular Languages of Words over Countable Linear Orderings
• Languages of Profinite Words and the Limitedness Problem
• Duality and Equational Theory of Regular Languages
• A Topological Approach to Recognition
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item