Pages that link to "Item:Q1589443"
From MaRDI portal
The following pages link to Re-describing an algorithm by Hopcroft (Q1589443):
Displaying 30 items.
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Fast brief practical DFA minimization (Q437674) (← links)
- Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
- Construction of minimal deterministic finite automata from biological motifs (Q627199) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- A search algorithm for subshift attractors of cellular automata (Q968269) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- An algorithm to compute the character access count distribution for pattern matching algorithms (Q1736492) (← links)
- A reduction technique for weighted grouping problems (Q1848576) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
- Minimisation of automata (Q2074212) (← 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)
- EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM (Q2941086) (← links)
- Hopcroft's algorithm and tree-like automata (Q3006159) (← links)
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics (Q3506945) (← links)
- Hopcroft’s Algorithm and Cyclic Automata (Q3540107) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Bisimilarity Minimization in O(m logn) Time (Q3636842) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- (Q5214815) (← links)
