Dynamic structures in modeling and simulation: a reflective approach
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
A coinductive calculus of streams
Mathematical Structures in Computer Science
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Control of Discrete-Event Systems with Partial Observations Using Coalgebra and Coinduction
Discrete Event Dynamic Systems
A (Co)algebraic analysis of synchronization in CSP
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
| Hi-index | 0.00 |
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to a transparent and uniform presentation of automata theory and yields some new insights, amongst which coinduction proof methods for language equality and language inclusion. At the same time, the present treatment of automata theory may serve as an introduction to coalgebra.