Generalizing determinization from automata to coalgebras

The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 9, Issue 1; no. 1
Main Authors:	Silva, Alexandra, Bonchi, Filippo, Bonsangue, Marcello, Rutten, Jan
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 04.03.2013 Logical Methods in Computer Science e.V
Subjects:	Computer Science computer science - logic in computer science f.3.2 Logic in Computer Science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!