Subsequential transducers: a coalgebraic perspective

DOI10.1016/j.ic.2009.10.008zbMath1209.68297MaRDI QIDQ618167

Helle Hvid Hansen

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

zbMATH Keywords

coalgebra; normalisation; differential; subsequential transducer; word function

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

Related Items

(Co)Algebraic Characterizations of Signal Flow Graphs

Cites Work

• 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
• 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