Pages that link to "Item:Q1959649"
From MaRDI portal
The following pages link to On extremal cases of Hopcroft's algorithm (Q1959649):
Displaying 21 items.
- 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)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- An extremal problem in the hypercube and optimization of asynchronous circuits (Q1568792) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Extension of Hoshen-Kopelman algorithm to non-lattice environments (Q1867874) (← links)
- Minimisation of automata (Q2074212) (← links)
- A combinatorial view on string attractors (Q2216440) (← links)
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← 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)
- Hopcroft’s Algorithm and Cyclic Automata (Q3540107) (← links)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055) (← links)
- Epichristoffel Words and Minimization of Moore Automata (Q5259268) (← links)
- Implementation and Application of Automata (Q5464005) (← links)
- Around Hopcroft’s Algorithm (Q5757215) (← links)
- String attractors and infinite words (Q6109022) (← links)
