Coalgebras for Bisimulation of Weighted Automata over Semirings
From MaRDI portal
Publication:5883750
DOI10.46298/lmcs-19(1:4)2023OpenAlexW3198116752MaRDI QIDQ5883750
Publication date: 22 March 2023
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.00732v4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Noncommutative minimization algorithms
- A coalgebraic perspective on linear weighted automata
- On the greatest fixed point of a set functor
- Handbook of weighted automata
- Universal coalgebra: A theory of systems
- Weighted automata
- Bisimulation relations for weighted automata
- What’s Decidable about Weighted Automata?
- Weighted Bisimulation in Linear Algebraic Form
- It is decidable whether a monadic thue system is canonical over a regular set
- On the definition of a family of automata
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Rational and Recognisable Power Series
- Generic Trace Semantics via Coinduction
- Automata, Languages and Programming
This page was built for publication: Coalgebras for Bisimulation of Weighted Automata over Semirings