Pages that link to "Item:Q4910757"
From MaRDI portal
The following pages link to Efficient Minimization of DFAs with Partial Transition Functions (Q4910757):
Displaying 13 items.
- Fast brief practical DFA minimization (Q437674) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- Average case analysis of Moore's state minimization algorithm (Q2429348) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- Weak Minimization of DFA — An Algorithm and Applications (Q3559776) (← links)
- Bisimilarity Minimization in O(m logn) Time (Q3636842) (← links)
- Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach (Q4989704) (← links)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems (Q5164166) (← links)
- An <i>O</i> ( <i>m</i> log <i>n</i> ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation (Q5278211) (← links)
- DFA with a Bounded Activity Level (Q5404937) (← links)
- Efficient algorithms for the inference of minimum size DFAs (Q5945683) (← links)
