Typed linear algebra for weigthed (probabilistic) automata
From MaRDI portal
Publication:2914693
Recommendations
Cites work
- scientific article; zbMATH DE number 45228 (Why is no real title available?)
- scientific article; zbMATH DE number 977284 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 2230055 (Why is no real title available?)
- A coalgebraic perspective on linear weighted automata
- A probability perspective
- Abstraction, Refinement and Proof for Probabilistic Systems
- Bisimulation relations for weighted automata
- Bisimulation through probabilistic testing
- Exercises in Quantifier Manipulation
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- Just do it
- Matrices as arrows! A biproduct approach to typed linear algebra
- Matrices, machines and behaviors
- Towards a linear algebra of programming
- Weighted automata and weighted logics
Cited in
(5)
This page was built for publication: Typed linear algebra for weigthed (probabilistic) automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914693)