Typed linear algebra for weigthed (probabilistic) automata
From MaRDI portal
Publication:2914693
DOI10.1007/978-3-642-31606-7_5zbMATH Open1297.68161OpenAlexW2122115222MaRDI QIDQ2914693FDOQ2914693
Authors: J. N. Oliveira
Publication date: 20 September 2012
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/24671
Recommendations
Formal languages and automata (68Q45) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Algebraic theory of languages and automata (68Q70) Special categories (18B99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Bisimulation relations for weighted automata
- Towards a linear algebra of programming
- Exercises in Quantifier Manipulation
- A coalgebraic perspective on linear weighted automata
- Title not available (Why is that?)
- Abstraction, Refinement and Proof for Probabilistic Systems
- FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell
- Matrices as arrows! A biproduct approach to typed linear algebra
- Weighted automata and weighted logics
- A probability perspective
- Matrices, machines and behaviors
- Just do it
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)