Pages that link to "Item:Q3084988"
From MaRDI portal
The following pages link to Simple Bisimilarity Minimization in O(m log n) Time (Q3084988):
Displaying 7 items.
- Fast brief practical DFA minimization (Q437674) (← links)
- BPA bisimilarity is EXPTIME-hard (Q1943623) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- An aperiodic set of 11 Wang tiles (Q5162865) (← links)
- Distributed coalgebraic partition refinement (Q6535613) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)