scientific article
From MaRDI portal
Publication:2980965
DOI10.23638/LMCS-13(1:3)2017zbMath1451.68181arXiv1609.08367MaRDI QIDQ2980965
Helle Hvid Hansen, Clemens Kupke, Jan J. M. M. Rutten
Publication date: 8 May 2017
Full work available at URL: https://arxiv.org/abs/1609.08367
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear systemscoalgebraautomatic sequencescoinductionbialgebrastreamsbehavioural differential equationscontext-free streams
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)
Related Items (4)
Companions, Codensity and Causality ⋮ Coinduction in Flow: The Later Modality in Fibrations ⋮ Distributive laws for monotone specifications ⋮ Integrating induction and coinduction via closure operators and proof cycles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A coalgebraic perspective on linear weighted automata
- Lazy productivity via termination
- Complete sets of cooperations
- Bialgebras for structural operational semantics: an introduction
- Category theory for operational semantics
- Bialgebraic methods and modal logic in structural operational semantics
- Universal coalgebra: A theory of systems
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- A proof of Moessner's theorem by coinduction
- Context-free coalgebras
- Distributive laws for the coinductive solution of recursive equations
- A tutorial on coinductive stream calculus and signal flow graphs
- Well-definedness of Streams by Transformation and Termination
- Newton Series, Coinductively
- Well-behaved Translations between Structural Operational Semantics
- Coalgebraic Characterizations of Context-Free Languages
- CIRC: A Behavioral Verification Tool Based on Circular Coinduction
- On the Final Coalgebra of Automatic Sequences
- Defining Context-Free Power Series Coalgebraically
- Coalgebraic Bisimulation-Up-To
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Automatic Sequences and Zip-Specifications
- Concrete stream calculus: An extended study
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
- Representations of Stream Processors Using Nested Fixed Points
- Rational streams coalgebraically
- CIRC: A Circular Coinductive Prover
- A New Representation of the Rational Numbers for Fast Easy Arithmetic
- Generalised coinduction
- Automatic Sequences
- A coinductive calculus of streams
- Elements of Stream Calculus
- Wellfounded recursion with copatterns
- Productive coprogramming with guarded recursion
- Language Constructs for Non-Well-Founded Computation
- Circular Coinduction in Coq Using Bisimulation-Up-To Techniques
- (Co)Algebraic Characterizations of Signal Flow Graphs
- A Final Coalgebra for k-regular Sequences
- Productivity of Stream Definitions
- Algebra and Coalgebra in Computer Science
- Derivatives of Regular Expressions
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- Presenting Distributive Laws
This page was built for publication:
