Exercises in Coalgebraic Specification
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Exercises in coalgebraic specification
Algebraic and coalgebraic methods in the mathematics of program construction
Coinductive counting with weighted automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Distributivity of categories of coalgebras
Theoretical Computer Science
Mathematical Structures in Computer Science
A coinductive calculus of streams
Mathematical Structures in Computer Science
Map Theory: From Well-Foundation to Antifoundation
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
Streams, (automata and) languages, and formal power series are viewed coalgebraically. In summary, this amounts to supplying these sets with a deterministic automaton structure, which has the universal property of being final. Finality then forms the basis for both definitions and proofs by coinduction, the coalgebraic counterpart of induction. Coinductive definitions take the shape of what we have called behavioural differential equations, after Brzozowski''s notion of input derivative. A calculus is developed for coinductive reasoning about all of the afore mentioned structures, closely resembling (and at times generalising) calculus from classical analysis.