Pages that link to "Item:Q2271419"
From MaRDI portal
The following pages link to Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419):
Displaying 13 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- Minimisation of automata (Q2074212) (← links)
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
- Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
- Average case analysis of Moore's state minimization algorithm (Q2429348) (← links)
- Hopcroft's algorithm and tree-like automata (Q3006159) (← links)
- A Challenging Family of Automata for Classical Minimization Algorithms (Q3073644) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
