Sciweavers

831 search results - page 2 / 167
» Coalgebraic Correspondence Theory
Sort
View
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
13 years 11 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
JSYML
2007
79views more  JSYML 2007»
13 years 4 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg
ENTCS
2002
152views more  ENTCS 2002»
13 years 4 months ago
Abstract Logics as Dialgebras
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
Alessandra Palmigiano
ACS
2008
13 years 5 months ago
On Minimal Coalgebras
Abstract. We define an out-degree for F-coalgebras and show that the coalgebras of outdegree at most form a covariety. As a subcategory of all Fcoalgebras, this class has a termin...
H. Peter Gumm
LFCS
2009
Springer
13 years 9 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington