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.

, ,
Software Engineering [SEN]
Computer Security

Rutten, J.J.M.M. (1998). Automata and coinduction (an exercise in coalgebra). Software Engineering [SEN]. CWI.