- Information and Computation 208 (2010) 13981420 Contents lists available at ScienceDirect
- Deriving Syntax and Axioms for Quantitative Regular Filippo Bonchi2
- Centrum Wiskunde & Informatica Kleene Coalgebras
- An exercise in coinduction: Moessner's theorem Centrum Wiskunde & Informatica (CWI)
- An algebra for Kripke polynomial coalgebras Marcello Bonsangue
- A Kleene Theorem for Polynomial Coalgebras Marcello Bonsangue1,2
- Algebraic Specification and Coalgebraic Synthesis of Mealy Automata
- Information and Computation 208 (2010)578593 Contents lists available at ScienceDirect
- ELSEVIER Theoretical ComputerScience 170 (1996) 349-381 Theoretical
- Logical Methods in Computer Science Vol. 4 (3:9) 2008, pp. 122
- Logical Methods in Computer Science Vol. 6 (3:23) 2010, pp. 1139
- Behavioural Differential Equations and Coinduction for Binary Trees
- An Application of Stream Calculus to Signal Flow Graphs
- Context-Free Languages, Coalgebraically Joost Winter1
- Kleene Coalgebra an overview Alexandra Silva1
- Intentional Automata: A Context-Dependent Model For Component Connectors
- Generalizing the powerset construction, coalgebraically
- A decision procedure for bisimilarity of generalized regular expressions
- Quantitative Kleene coalgebras Filippo Bonchia
- Scientific Annals of Computer Science vol.XX, 20XX "Alexandru Ioan Cuza" University of Iasi, Romania
- Centrum Wiskunde & Informatica Short Contributions
- Sampling, Splitting and Merging in Coinductive Stream Calculus
- Centrum Wiskunde & Informatica Sampling, splitting and merging in coinductive
- Fault-based Test Case Generation for Component Connectors Bernhard K. Aichernig1,2
- Observational Coalgebras and Complete Sets of Co-operations
- Coalgebraic Logic and Synthesis of Mealy Machines M.M. Bonsangue1,2
- Coalgebraic Foundations of Linear Systems (An Exercise in Stream Calculus)
- Synthesis of Mealy Machines Using Derivatives
- Math. Struct. in Comp. Science (2005), vol. 15, pp. 93147. c 2005 Cambridge University Press DOI: 10.1017/S0960129504004517 Printed in the United Kingdom
- Theoretical Computer Science 308 (2003) 153 www.elsevier.com/locate/tcs
- Theoretical Computer Science 249 (2000) 380 www.elsevier.com/locate/tcs
- Centrum voor Wiskunde en Informatica REPORTRAPPORT
- Math. Struct. in Comp. Science (1998), vol. 8, pp. 481540. Printed in the United Kingdom c 1998 Cambridge University Press
- Electronic Notes in Theoretical Computer Science 11 (1998), Pages 1{7 Relators and Metric Bisimulations
- Motivation Introduction Linear maps as stream circuits Final semantics In conclusion Linear systems, coalgebraically
- On Streams and Coinduction The natural numbers are the most famous instance of an initial algebra and
- Complete sets of cooperations Clemens Kupke a,1
- Context-Free Languages, Coalgebraically Joost Winter1,
- Information and Computation 209 (2011) 822849 Contents lists available at ScienceDirect
- An introduction to (co)algebra and (co)induction 1.1 Introduction
- On the final coalgebra of automatic sequences Clemens Kupke1 and Jan Rutten2,3
- Automata and Coinduction (An Exercise in Coalgebra)
- Automatic equivalence proofs for non-deterministic Marcello Bonsanguea,d
- Brzozowski's algorithm (co)algebraically F. Bonchi1, M.M. Bonsangue2,3, J.J.M.M. Rutten3,4, A.M. Silva3,4,5
- Information and Computation 211 (2012) 77105 Contents lists available at SciVerse ScienceDirect
- Stream Differential Equations: concrete formats for coinductive definitions
