THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
From MaRDI portal
Publication:3224952
Recommendations
- Simulations of weighted tree automata
- A Backward and a Forward Simulation for Weighted Tree Automata
- Computing Simulations over Tree Automata
- Quantitative simulations by matrices
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Fair simulation for nondeterministic and probabilistic Büchi automata: a coalgebraic perspective
- scientific article; zbMATH DE number 1927559
- Quantitative fair simulation games
- Simulation algorithms for symbolic automata
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- Axiomatizing the equational theory of regular tree languages
- Bisimulation relations for weighted automata
- Continuous monoids and semirings
- Effective construction of the syntactic algebra of a recognizable series on trees
- Handbook of weighted automata
Cited in
(12)- Bisimulations for weighted automata over an additively idempotent semiring
- A Backward and a Forward Simulation for Weighted Tree Automata
- Stream differential equations: specification formats and solution methods
- Simulations of weighted tree automata
- A final coalgebra for \(k\)-regular sequences
- Algebra-coalgebra duality in Brzozowski's minimization algorithm
- Ambiguity Hierarchies for Weighted Tree Automata
- Quantitative simulations by matrices
- From generic partition refinement to weighted tree automata minimization
- A completeness result for finite \(\lambda\)-bisimulations
- Ambiguity hierarchies for weighted tree automata
- Hopf semialgebras.
This page was built for publication: THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224952)
