Pages that link to "Item:Q3636842"
From MaRDI portal
The following pages link to Bisimilarity Minimization in O(m logn) Time (Q3636842):
Displaying 9 items.
- Fast brief practical DFA minimization (Q437674) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- Persistent Stochastic Non-Interference (Q5158656) (← links)
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems (Q5164166) (← links)
- Causal Semantics for BPP Nets with Silent Moves (Q5164874) (← links)
- (Q5214815) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
