Pages that link to "Item:Q1982644"
From MaRDI portal
The following pages link to From generic partition refinement to weighted tree automata minimization (Q1982644):
Displaying 8 items.
- Lumpability for uncertain continuous-time Markov chains (Q832091) (← links)
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata (Q1797781) (← links)
- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata (Q3190170) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- (Q5214815) (← links)
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
- Distributed coalgebraic partition refinement (Q6535613) (← links)
- Explicit Hopcroft's trick in categorical partition refinement (Q6666777) (← links)