THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
From MaRDI portal
Publication:3224952
DOI10.1142/S0129054111009070zbMath1244.68046OpenAlexW2038755815MaRDI QIDQ3224952
Publication date: 13 March 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111009070
Related Items
Unnamed Item, Ambiguity Hierarchies for Weighted Tree Automata, From generic partition refinement to weighted tree automata minimization, Algebra-coalgebra duality in brzozowski's minimization algorithm, A Final Coalgebra for k-regular Sequences, Quantitative simulations by matrices, Hopf Semialgebras, Ambiguity hierarchies for weighted tree automata
Cites Work
- Continuous monoids and semirings
- Handbook of weighted automata
- Axiomatizing the equational theory of regular tree languages
- Effective construction of the syntactic algebra of a recognizable series on trees
- A completeness theorem for Kleene algebras and the algebra of regular events
- Bisimulation relations for weighted automata