24 search results - page 4 / 5 » calco 2009 |
CALCO
2009
Springer
13 years 12 months ago
2009
Springer
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...
CALCO
2009
Springer
13 years 12 months ago
2009
Springer
The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g....
CALCO
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
CALCO
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Completely iterative algebras (cias) are those algebras in which recursive equations have unique solutions. In this paper we study complete iterativity for algebras with ...
CALCO
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. In this paper we describe a language and method for deriving ontologies and ordering databases. The ontological structures arrived at are distributive lattices with attri...