23 search results - page 2 / 5 » Rational streams coalgebraically |
FOSSACS
2010
Springer
14 years 4 days ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
CALCO
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the fin...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
ENTCS
2006
13 years 5 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
FOSSACS
2012
Springer
12 years 1 months ago
2012
Springer
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...