Pages that link to "Item:Q3549289"
From MaRDI portal
The following pages link to Hyper-minimizing minimized deterministic finite state automata (Q3549289):
Displaying 19 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Boundary sets of regular and context-free languages (Q896680) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- Building efficient and compact data structures for simplicial complexes (Q2408925) (← links)
- Better Hyper-minimization (Q3073639) (← links)
- Closure properties of hyper-minimized automata (Q3117549) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- OPTIMAL HYPER-MINIMIZATION (Q3224954) (← links)
- HYPER-MINIMIZATION IN O(n<sup>2</sup>) (Q3395144) (← links)
- Hyper-Minimization in O(n 2) (Q3602817) (← links)
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (Q3637336) (← links)
- UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION (Q4923276) (← links)
- (Q5015284) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- (Q5094125) (← links)
- (Q5101349) (← links)
- Computing All ℓ-Cover Automata Fast (Q5200065) (← links)
- HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA (Q5401558) (← links)
