Generalizing the powerset construction, coalgebraically (2010)

by Alexandra Silva , Filippo Bonchi , Marcello M. Bonsangue , Jan J. M. M. Rutten
Citations:7 - 4 self

Documents Related by Co-Citation

67 Canonical regular expressions and minimal state graphs for definite events – J A Brzozowski - 1962
298 Universal coalgebra: a theory of systems – J. J. M. M. Rutten - 2000
45 Taxonomies and Toolkits of Regular Language Algorithms – Bruce W Watson - 1995
20 Machines in a category – M A ARBIB, E G MANES - 1980
6 Directly constructing minimal DFAs: Combining two algorithms by Brzozowski – B W WATSON
4 Nondeterministic moore automata and brzozowski’s algorithm – G Castiglione, A Restivo, M Sciortino
108 Kleene algebra with tests – Dexter Kozen - 1997
51 Elements of automata theory – J Sakarovitch - 2009
172 Probabilistic automata – M O Rabin - 1963
115 On the definition of a family of automata – M Schützenberger - 1961
12 On the Duality between Observability and Reachability – Michel Bidoit, Rolf Hennicker, Alexander Kurz - 2001
38 On Generalised Coinduction and Probabilistic Specification Formats: Distributive Laws in Coalgebraic Modelling – Falk Bartels - 2004
62 Automata and coinduction (an exercise in coalgebra – J. J. M. M. Rutten - 1998
2 C.: Minimization via duality (Unpublished note – N Bezhanishvili, P Panangaden, Kupke
14 Adjoint machines, state-behaviour machines, and duality – M A Arbib, E G Manes - 1975
127 Automata and Computability – D C Kozen - 1997
12 On-the-fly Verification of Finite Transition Systems – Jean-Claude Fernandez , Claude Jard, Laurent Mounier, Thierry Jéron - 1993
16 Graphes canoniques de graphes algébriques – D Caucal - 1990
2 An n log n algorithm for minimizing in a finite automaton – J E Hopcroft - 1971