Pages that link to "Item:Q1959648"
From MaRDI portal
The following pages link to An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648):
Displaying 10 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- Better Hyper-minimization (Q3073639) (← links)
- Closure properties of hyper-minimized automata (Q3117549) (← links)
- OPTIMAL HYPER-MINIMIZATION (Q3224954) (← 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)
- Minimal and Hyper-Minimal Biautomata (Q5890813) (← links)
