WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES

DOI10.1142/S0129054113400145zbMath1353.68188MaRDI QIDQ5401551

José Nuno Oliveira

Publication date: 10 March 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

linear algebraweighted automatacategories of matrices

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (5)

``Keep definition, change category -- a practical approach to state-based system calculi ⋮ An exercise on the generation of many-valued dynamic logics ⋮ Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm ⋮ An algebraic framework for minimum spanning tree problems ⋮ A linear algebra approach to OLAP

Cites Work

• A coalgebraic perspective on linear weighted automata
• Quantitative Kleene coalgebras
• Lawvere completeness in topology
• Variation through enrichment
• Bisimulation through probabilistic testing
• One setting for all: Metric, topology, uniformity, approach structure
• Universal coalgebra: A theory of systems
• Products of coalgebras.
• Towards a linear algebra of programming
• Categorical representation theorems of fuzzy relations
• Bisimulation relations for weighted automata
• Matrices, machines and behaviors

This page was built for publication: WEIGHTED AUTOMATA AS COALGEBRAS IN CATEGORIES OF MATRICES