Pages that link to "Item:Q3540107"
From MaRDI portal
The following pages link to Hopcroft’s Algorithm and Cyclic Automata (Q3540107):
Displaying 15 items.
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← 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)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (Q3637336) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)
