Pages that link to "Item:Q3395144"
From MaRDI portal
The following pages link to HYPER-MINIMIZATION IN O(n<sup>2</sup>) (Q3395144):
Displaying 11 items.
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\) (Q1924622) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- Better Hyper-minimization (Q3073639) (← links)
- OPTIMAL HYPER-MINIMIZATION (Q3224954) (← links)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems (Q3912012) (← links)
- UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION (Q4923276) (← links)
- More on Minimizing Finite Automata with Errors — Nondeterministic Machines (Q5268394) (← links)
- HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA (Q5401558) (← links)
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS (Q5495421) (← links)
