Pages that link to "Item:Q1959649"
From MaRDI portal
The following pages link to On extremal cases of Hopcroft's algorithm (Q1959649):
Displaying 9 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 combinatorial view on string attractors (Q2216440) (← 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)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055) (← links)