Automata and Coinduction (An Exercise in Coalgebra)

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

• Type: Conference
• Year: 1998
• Where: CONCUR
• Authors: Jan J. M. M. Rutten
• Keywords: Automata Theory, Coinduction Proof Methods, CONCUR 1998, Deterministic Automata, Distributed And Parallel Computing