Pages that link to "Item:Q2554307"
From MaRDI portal
The following pages link to Describing an algorithm by Hopcroft (Q2554307):
Displaying 30 items.
- 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)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Average complexity of Moore's and Hopcroft's algorithms (Q764328) (← links)
- A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- Sorting and doubling techniques for set partitioning and automata minimization problems (Q1575899) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← 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)
- EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM (Q2941086) (← links)
- Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments (Q3087999) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← 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)
- Morphisms and Minimisation of Weighted Automata (Q5038573) (← links)
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
- Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
- Computing All ℓ-Cover Automata Fast (Q5200065) (← links)
- (Q5214815) (← links)
- Distributed coalgebraic partition refinement (Q6535613) (← links)
- Generic partition refinement and weighted tree automata (Q6535955) (← links)
- Explicit Hopcroft's trick in categorical partition refinement (Q6666777) (← links)
