A coalgebraic perspective on linear weighted automata

DOI10.1016/j.ic.2011.12.002zbMath1279.68235OpenAlexW2588294347MaRDI QIDQ418134

Alexandra Silva, Filippo Bonchi, Michele Boreale, Marcello M. Bonsangue, Jan J. M. M. Rutten

Publication date: 24 May 2012

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.12.002

zbMATH Keywords

coalgebrasprobabilitylanguage equivalencebisimilaritylinear weighted automatanon-deterministic automataSetVect

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (23)

Coalgebras for Bisimulation of Weighted Automata over Semirings ⋮ Unnamed Item ⋮ ``Keep definition, change category -- a practical approach to state-based system calculi ⋮ Typed Linear Algebra for Weigthed (Probabilistic) Automata ⋮ Equations and Coequations for Weighted Automata ⋮ A complete logic for behavioural equivalence in coalgebras of finitary set functors ⋮ Coalgebraic constructions of canonical nondeterministic automata ⋮ Preservation and reflection of bisimilarity via invertible steps ⋮ Singular value automata and approximate minimization ⋮ Enhanced coalgebraic bisimulation ⋮ Weighted Automata over Vector Spaces ⋮ Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ Combining semilattices and semimodules ⋮ Up-To Techniques for Weighted Systems ⋮ WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES ⋮ Algebra-coalgebra duality in brzozowski's minimization algorithm ⋮ A general account of coinduction up-to ⋮ Product Rules and Distributive Laws ⋮ Unnamed Item ⋮ Automatic pre- and postconditions for partial differential equations ⋮ On the Coalgebra of Partial Differential Equations ⋮ Bisimulation metrics and norms for real-weighted automata ⋮ Context-free coalgebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of weighted automata
• CCS expressions, finite state processes, and three problems of equivalence
• Copower functors
• Bisimulation through probabilistic testing
• Nonlinear control systems.
• Minimization algorithms for sequential transducers
• Universal coalgebra: A theory of systems
• Products of coalgebras.
• Quasideterminants
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Terminal coalgebras in well-founded set theory
• Bisimulation relations for weighted automata
• Weighted Bisimulation in Linear Algebraic Form
• On the definition of a family of automata
• Conjugacy and Equivalence of Weighted Automata and Functional Transducers
• Rational streams coalgebraically
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• A coinductive calculus of streams
• Monoid-labeled transition systems
• Digital Image Compression
• Model Checking Linear-Time Properties of Probabilistic Systems
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS

This page was built for publication: A coalgebraic perspective on linear weighted automata