Weighted GKAT: completeness and complexity

DOI10.4230/LIPICS.ICALP.2025.172MaRDI QIDQ7397634zbMATH OpenFDO

Authors Spencer Van Koevering, Wojciech Różowski, Alexandra Silva

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.172

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A completeness theorem for Kleene algebras and the algebra of regular events
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• Coalgebras of bounded type
• Copower functors
• Efficient and modular coalgebraic partition refinement
• Generic partition refinement and weighted tree automata
• Handbook of weighted automata
• Inductive \(^{*}\)-semirings
• Iteration Semirings
• Monoid-labeled transition systems
• Refinement monoids, equidecomposability types, and Boolean inverse semigroups
• The equality problem for rational series with multiplicities in the tropical semiring is undecidable
• Three Partition Refinement Algorithms
• Two Complete Axiom Systems for the Algebra of Regular Events
• Universal coalgebra: A theory of systems

This page was built for publication: Weighted GKAT: completeness and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397634)