Subsequential transducers: a coalgebraic perspective
From MaRDI portal
Publication:618167
DOI10.1016/j.ic.2009.10.008zbMath1209.68297OpenAlexW2144143049MaRDI QIDQ618167
Publication date: 14 January 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.10.008
Related Items (4)
Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure ⋮ (Co)Algebraic Characterizations of Signal Flow Graphs ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of probabilistic system types
- On minimal coalgebras
- Confluent linear numeration systems
- Sur une variante des fonctions séquentielles
- A proof of Choffrut's theorem on subsequential functions
- Universal coalgebra: A theory of systems
- Re-describing an algorithm by Hopcroft
- Determinization of transducers over finite and infinite words.
- Minimizing subsequential transducers: a survey.
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Describing an algorithm by Hopcroft
- Types and coalgebraic structure
- Computing the prefix of an automaton
- Towards Weak Bisimulation For Coalgebras
- Coalgebraising Subsequential Transducers
- A Kleene Theorem for Polynomial Coalgebras
- Coalgebraic Automata Theory: Basic Results
- Minimization of Rational Word Functions
- A note on Coinduction and Weak Bisimilarity for While Programs
- Functors for coalgebras
This page was built for publication: Subsequential transducers: a coalgebraic perspective
