Recommendations
Cited in
(18)- A categorical framework for learning generalised tree automata
- Combining semilattices and semimodules
- scientific article; zbMATH DE number 6528605 (Why is no real title available?)
- Minimality Notions via Factorization Systems and Examples
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
- Moss' logic for ordered coalgebras
- A coalgebraic view on reachability
- scientific article; zbMATH DE number 7649888 (Why is no real title available?)
- scientific article; zbMATH DE number 7649889 (Why is no real title available?)
- A Myhill-Nerode theorem for higher-dimensional automata
- A new approach for active automata learning based on apartness
- A categorical approach to coalgebraic fixpoint logic
- Proving behavioural apartness
- Learning automata and transducers: a categorical approach
- Active learning of deterministic transducers with outputs in arbitrary monoids
- Active learning of deterministic transducers with outputs in arbitrary monoids
- Complete test suites for automata in monoidal closed categories
- Feasability of learning weighted automata on a semiring
This page was built for publication: Coalgebra learning via duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289063)