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...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 9, Issue 1; číslo 1
Hlavní autori:	Silva, Alexandra, Bonchi, Filippo, Bonsangue, Marcello, Rutten, Jan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 04.03.2013 Logical Methods in Computer Science e.V
Predmet:	Computer Science computer science - logic in computer science f.3.2 Logic in Computer Science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!