Subsequential transducers: a coalgebraic perspective

DOI10.1016/J.IC.2009.10.008zbMATH Open1209.68297OpenAlexW2144143049MaRDI QIDQ618167FDOQ618167

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

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

zbMATH Keywords

differentialcoalgebranormalisationsubsequential transducerword function

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• FINITELY SUBSEQUENTIAL TRANSDUCERS
• (Co)Algebraic Characterizations of Signal Flow Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure

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)