Describing an algorithm by Hopcroft
From MaRDI portal
Cited in
(31)- On the Hopcroft's minimization technique for DFA and DFCA
- Graph isomorphism problem
- Succinctness of descriptions of SBTA-languages
- Sorting and doubling techniques for set partitioning and automata minimization problems
- Re-describing an algorithm by Hopcroft
- Efficient minimization of deterministic weak -automata
- From generic partition refinement to weighted tree automata minimization
- Minimisation of automata
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm
- Verified synthesis of knowledge-based programs in finite synchronous environments
- Hyper-minimisation Made Efficient
- Hopcroft’s Algorithm and Cyclic Automata
- Hopcroft’s Minimization Technique: Queues or Stacks?
- Bisimilarity Minimization in O(m logn) Time
- Fast brief practical DFA minimization
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Morphisms and Minimisation of Weighted Automata
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
- Efficient Coalgebraic Partition Refinement
- Computing all -cover automata fast
- Efficient and modular coalgebraic partition refinement
- Subsequential transducers: a coalgebraic perspective
- Distributed coalgebraic partition refinement
- Generic partition refinement and weighted tree automata
- Explicit Hopcroft's trick in categorical partition refinement
- Circular Sturmian words and Hopcroft's algorithm
- Knowledge-based programs
- Average complexity of Moore's and Hopcroft's algorithms
- A split-based incremental deterministic automata minimization algorithm
- Description and analysis of a bottom-up DFA minimization algorithm
This page was built for publication: Describing an algorithm by Hopcroft
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2554307)
