The following pages link to Hyper-minimisation Made Efficient (Q3182939):
Displaying 11 items.
- The tractability frontier for NFA minimization (Q414869) (← 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)
- Minification processes and their transformations (Q3353891) (← links)
- (Q3675437) (← links)
- Sliding windows over context-free languages (Q5005113) (← links)
- Computing All ℓ-Cover Automata Fast (Q5200065) (← links)
- Efficient minimal preference change (Q5222679) (← links)
- \textsf{tHyENA}: making \textsf{HyENA} even smaller (Q6157569) (← links)