Rational Streams Coalgebraically

@article{Rutten2008RationalSC,
  title={Rational Streams Coalgebraically},
  author={Jan J. M. M. Rutten},
  journal={ArXiv},
  year={2008},
  volume={abs/0807.4073}
}
  • J. Rutten
  • Published 25 July 2008
  • Computer Science
  • ArXiv
We study rational streams (over a field) from a coalgebraic perspective. Ex- ploiting the finality of the set of streams, we present an elementary and uniform proof of the equivalence of four notions of representability of rational streams: by finite dimensional linear systems; by finite stream circuits; by finite weighted stream automata; and by finite dimensional subsystems of the set of streams. 
Stream processing coalgebraically
TLDR
It is shown that stream circuits extended with gates for dyadic split and merge are expressive enough to realise some non-rational algebraic streams, thereby going beyond ordinary stream circuits. Expand
Context-free coalgebras
TLDR
A link between automatic sequences and systems of differential equations is established, allowing us to, given an automaton generating an automatic sequence, easily construct a system of behavioural differential equations yielding this sequence as a context-free stream. Expand
A Sound and Complete Calculus for Finite Stream Circuits
  • S. Milius
  • Mathematics, Computer Science
  • 2010 25th Annual IEEE Symposium on Logic in Computer Science
  • 2010
TLDR
It is proved that a final locally finite (dimensional) coalgebra is, equivalently, an initial iterative algebra of the category of real vector spaces and makes the connection to existing work on the semantics of recursive specifications. Expand
Finitary Corecursion for the
Kurz et al. have recently shown that infinite -trees with finitely many free variables modulo -equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigateExpand
On the specification of operations on the rational behaviour of systems
TLDR
This work introduces a format for specification of algebraic operations that restrict to the rational fixpoint of a functor, which captures the behaviour of finite systems and shows that rational behaviour is closed under operations specified in this format. Expand
Algebra and Coalgebra in Computer Science
TLDR
An effect system for algebraic effects and handlers is presented, based on a domain-theoretic model with partial equivalence relations, which validates equational reasoning about effectful computations. Expand
Sampling, Splitting and Merging in Coinductive Stream Calculus
TLDR
It is shown that stream circuits extended with gates for dyadic split and merge are expressive enough to realise some non-rational algebraic streams, thereby going beyond ordinary stream circuits. Expand
Coalgebraic Characterizations of Automata-Theoretic Classes
TLDR
It turns out that categories of Brzozowski bialgebras share many similarities with categories of λ-bialgebra categories, and the crucial lemma still holds at the same level of generality. Expand
Finitary Corecursion for the Infinitary Lambda Calculus
TLDR
It is proved that the rational fixpoint of a functor on the category of nominal sets is formed by all rational $\lambda$-trees, i.e. those which have only finitely many subtrees (up to isomorphism), which yields a corecursion principle that allows the definition of operations such as substitution on rational $\ lambda$-Trees. Expand
Proper Functors and their Rational Fixed Point
  • S. Milius
  • Mathematics, Computer Science
  • CALCO
  • 2017
TLDR
It is shown that for proper functors the rational fixed point is determined as the colimit of all coalgebras with a free finitely generated algebra as carrier and it is a subcoalgebra of the final coalgebra. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 14 REFERENCES
A coinductive calculus of streams
  • J. Rutten
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2005
TLDR
A coinductive calculus of streams based on the presence of a final coalgebra structure on the set of streams (infinite sequences of real numbers) is developed, which can be used to formulate both coinduction proofs and definitions. Expand
Coalgebraic Foundations of Linear Systems
  • J. Rutten
  • Computer Science, Mathematics
  • CALCO
  • 2007
Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the final coalgebras of streams andExpand
Algebra, bitstreams, and circuits
TLDR
Four different algebraic structures on the set of bitstreams are defined in a uniform way, motivating each of them in terms of the digital circuits they can describe, and for one of these, the 2-adic numbers, a class of linear digital circuits is characterised in terms. Expand
Synthesis of Mealy Machines Using Derivatives
TLDR
This paper completes the construction of Mealy machines from specifications in both 2-adic and modulo-2 arithmetic by describing how to decide equivalence of expressions via reduction to normal forms and presents a Haskell implementation of this Mealy synthesis algorithm. Expand
Rational series and their languages
TLDR
This chapter discusses the development of Rational Series over a Principal Ring, a model based on the model developed in Chapter I, and its applications to Languages and Codes. Expand
Algebra
THIS is a text–book intended primarily for undergraduates. It is designed to give a broad basis of knowledge comprising such theories and theorems in those parts of algebra which are mentioned in theExpand
A survey of modern algebra
This classic, written by two young instructors who became giants in their field, has shaped the understanding of modern algebra for generations of mathematicians and remains a valuable reference andExpand
Automatic sequences. Theory, applications, generalizations
What do you do to start reading automatic sequences theory applications generalizations? Searching the book that you love to read first or find an interesting book that will make you want to read?Expand
Linear systems
Most of the signal processing that we will study in this course involves local operations on a signal, namely transforming the signal by applying linear combinations of values in the neighborhood ofExpand
Automatic sequences: theory
  • applications, generalizations. Cambridge University Press
  • 2003
...
1
2
...