Pages that link to "Item:Q5464005"
From MaRDI portal
The following pages link to Implementation and Application of Automata (Q5464005):
Displayed 19 items.
- A graph theoretic approach to automata minimality (Q418805) (← links)
- 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)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← 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)
- 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)
- Hopcroft's algorithm and tree-like automata (Q3006159) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- Hopcroft’s Algorithm and Cyclic Automata (Q3540107) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (Q3637336) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- Lowerbounds for Bisimulation by Partition Refinement (Q6135758) (← links)