A coalgebraic perspective on linear weighted automata
From MaRDI portal
(Redirected from Publication:418134)
Recommendations
Cites work
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 1014125 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2028925 (Why is no real title available?)
- scientific article; zbMATH DE number 2040327 (Why is no real title available?)
- scientific article; zbMATH DE number 1772585 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- scientific article; zbMATH DE number 3451986 (Why is no real title available?)
- scientific article; zbMATH DE number 922677 (Why is no real title available?)
- A coinductive calculus of streams
- Behavioural differential equations: a coinductive calculus of streams, automata, and power series
- Bisimulation relations for weighted automata
- Bisimulation through probabilistic testing
- CCS expressions, finite state processes, and three problems of equivalence
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Copower functors
- Digital image compression
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- Handbook of weighted automata
- Minimization algorithms for sequential transducers
- Model checking linear-time properties of probabilistic systems
- Monoid-labeled transition systems
- Nonlinear control systems.
- On the definition of a family of automata
- Products of coalgebras.
- Quasideterminants
- Rational streams coalgebraically
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Terminal coalgebras in well-founded set theory
- Universal coalgebra: A theory of systems
- Weighted Bisimulation in Linear Algebraic Form
Cited in
(30)- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata
- Up-To Techniques for Weighted Systems
- Coalgebras for Bisimulation of Weighted Automata over Semirings
- Weighted automata as coalgebras in categories of matrices
- Equations and coequations for weighted automata
- Minimisation in logical form
- Preservation and reflection of bisimilarity via invertible steps
- Products, polynomials and differential equations in the stream calculus
- Stream differential equations: specification formats and solution methods
- Weighted Bisimulation in Linear Algebraic Form
- scientific article; zbMATH DE number 7204386 (Why is no real title available?)
- Weighted Automata over Vector Spaces
- On the Coalgebra of Partial Differential Equations
- Sound and complete axiomatizations of coalgebraic language equivalence
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- Coalgebraic constructions of canonical nondeterministic automata
- Typed linear algebra for weigthed (probabilistic) automata
- A complete logic for behavioural equivalence in coalgebras of finitary set functors
- Coalgebraic Semantics of Heavy-Weighted Automata
- Singular value automata and approximate minimization
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- Enhanced coalgebraic bisimulation
- Bisimulation metrics and norms for real-weighted automata
- A general account of coinduction up-to
- Context-free coalgebras
- Product rules and distributive laws
- Combining semilattices and semimodules
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Deriving Syntax and Axioms for Quantitative Regular Behaviours
- Automatic pre- and postconditions for partial differential equations
This page was built for publication: A coalgebraic perspective on linear weighted automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418134)
