Typed Linear Algebra for Weigthed (Probabilistic) Automata

DOI10.1007/978-3-642-31606-7_5zbMath1297.68161OpenAlexW2122115222MaRDI QIDQ2914693

José Nuno 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

zbMATH Keywords

linear algebraweighted automatacategories of matrices

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Algebraic theory of languages and automata (68Q70) Special categories (18B99)

Related Items (2)

Relations in linear algebra ⋮ Relational style laws and constructs of linear algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coalgebraic perspective on linear weighted automata
• A probability perspective
• Bisimulation through probabilistic testing
• Towards a linear algebra of programming
• Bisimulation relations for weighted automata
• Matrices, machines and behaviors
• Matrices as Arrows!
• Exercises in Quantifier Manipulation
• Abstraction, Refinement and Proof for Probabilistic Systems
• Weighted Automata and Weighted Logics
• Just do it
• FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

This page was built for publication: Typed Linear Algebra for Weigthed (Probabilistic) Automata