scientific article; zbMATH DE number 7649889
From MaRDI portal
Publication:5875346
Recommendations
Cites work
- A Coalgebraic Perspective on Minimization and Determinization
- A completeness theorem for Kleene algebras and the algebra of regular events
- A general account of coinduction up-to
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Abstract and concrete categories: the joy of cats
- Adjoint machines, state-behavior machines, and duality
- Automata theory in nominal sets
- Backward and forward bisimulation minimization of tree automata
- BISIMULATION MINIMIZATION OF TREE AUTOMATA
- Coalgebra learning via duality
- Coalgebraic trace semantics via forgetful logics
- Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
- Concurrent Kleene algebra: free model and completeness
- Discrete Generalised Polynomial Functors
- Efficient Coalgebraic Partition Refinement
- Enhancements of the bisimulation proof method
- Foundations of system theory: Multidecomposable systems
- Generalizing determinization from automata to coalgebras
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 3770955 (Why is no real title available?)
- scientific article; zbMATH DE number 46168 (Why is no real title available?)
- scientific article; zbMATH DE number 3458870 (Why is no real title available?)
- scientific article; zbMATH DE number 1216133 (Why is no real title available?)
- scientific article; zbMATH DE number 1304993 (Why is no real title available?)
- scientific article; zbMATH DE number 822489 (Why is no real title available?)
- Learning context-free grammars from structural data in polynomial time
- Learning Multiplicity Tree Automata
- Lifting theorems for Kleisli categories
- Machines in a Category: An Expository Introduction
- Monads on symmetric monoidal closed categories
- Nominal (universal) algebra: equational logic with names and binding
- Nominal sets. Names and symmetry in computer science
- Notions of Lawvere theory
- On the Determinization of Weighted Finite Automata
- On universal algebra over nominal sets
- Query learning of regular tree languages: How to avoid dead states
- Realization theory for automata in categories
- Recognisable languages over monads
- Series-parallel languages and the bounded-width property
- Structural induction and coinduction in a fibrational setting
Cited in
(11)- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- A categorical framework for learning generalised tree automata
- scientific article; zbMATH DE number 3866601 (Why is no real title available?)
- Determinisation of Relational Substitutions in Ordered Categories with Domain
- scientific article; zbMATH DE number 4075145 (Why is no real title available?)
- scientific article; zbMATH DE number 168434 (Why is no real title available?)
- TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
- A congruence-based perspective on finite tree automata
- Syntactically and semantically regular languages of -terms coincide through logical relations
- Nominal tree automata with name allocation
- Learning bottom-up tree automata valued in monoidal categories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875346)
