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.

, ,
Software Engineering [SEN]
Computer Security

Rutten, J.J.M.M. (2000). Behavioural differential equations : a coinductive calculus of streams, automata, and power series. Software Engineering [SEN]. CWI.