Subsequential transducers: a coalgebraic perspective

DOI10.1016/J.IC.2009.10.008MaRDI QIDQ618167zbMATHOpenAlexFDO

Authors 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

differentialcoalgebranormalisationsubsequential transducerword function

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Coalgebraising subsequential transducers
• Minimizing subsequential transducers: a survey.
• A Coalgebraic Perspective on Minimization and Determinization
• Generalizing determinization from automata to coalgebras
• scientific article; zbMATH DE number 1962764

Cites work

• scientific article; zbMATH DE number 3653575 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 19761 (Why is no real title available?)
• scientific article; zbMATH DE number 46168 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 1033559 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• A Kleene Theorem for Polynomial Coalgebras
• A hierarchy of probabilistic system types
• A note on Coinduction and Weak Bisimilarity for While Programs
• A proof of Choffrut's theorem on subsequential functions
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Coalgebraic Automata Theory: Basic Results
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Coalgebraising subsequential transducers
• Computing the prefix of an automaton
• Confluent linear numeration systems
• Describing an algorithm by Hopcroft
• Determinization of transducers over finite and infinite words.
• Functors for coalgebras
• Minimization of Rational Word Functions
• Minimizing subsequential transducers: a survey.
• On minimal coalgebras
• Re-describing an algorithm by Hopcroft
• Sur une variante des fonctions séquentielles
• Towards weak bisimulation for coalgebras
• Types and coalgebraic structure
• Universal coalgebra: A theory of systems
• Weak bisimulation for action-type coalgebras (extended abstract)

Cited in

(6)

• FINITELY SUBSEQUENTIAL TRANSDUCERS
• Coalgebraising subsequential transducers
• scientific article; zbMATH DE number 7204386 (Why is no real title available?)
• scientific article; zbMATH DE number 7199591 (Why is no real title available?)
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
• (Co)algebraic characterizations of signal flow graphs

This page was built for publication: Subsequential transducers: a coalgebraic perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q618167)