Automata and coinduction (an exercise in coalgebra

Automata and coinduction (an exercise in coalgebra (1998)

by J. J. M. M. Rutten

Venue:	LNCS
Citations:	51 - 15 self

User correction supplied by mph

Datum	Value	Source
TITLE	Automata and coinduction (an exercise in coalgebra	INFERENCE
AUTHOR NAME	J. J. M. M. Rutten	user correction
AUTHOR AFFIL	CWI	user correction
AUTHOR ADDR	P.O. Box 94079, 1090 GB Amsterdam, The Netherlands*	user correction
ABSTRACT	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.	user correction
YEAR	1998	INFERENCE
VENUE	LNCS	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	194--218	INFERENCE
CITATIONS	12 found	ParsCit 1.0