Describing an algorithm by Hopcroft
From MaRDI portal
Publication:2554307
DOI10.1007/BF00264025zbMath0242.94042MaRDI QIDQ2554307
Publication date: 1973
Published in: Acta Informatica (Search for Journal in Brave)
Related Items
Morphisms and Minimisation of Weighted Automata, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, Hyper-minimisation Made Efficient, Unnamed Item, EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM, Succinctness of descriptions of SBTA-languages, Subsequential transducers: a coalgebraic perspective, A split-based incremental deterministic automata minimization algorithm, Fast brief practical DFA minimization, Hopcroft’s Algorithm and Cyclic Automata, Cycle-aware minimization of acyclic deterministic finite-state automata, From generic partition refinement to weighted tree automata minimization, Description and analysis of a bottom-up DFA minimization algorithm, Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm, Hopcroft’s Minimization Technique: Queues or Stacks?, Computing All ℓ-Cover Automata Fast, Circular Sturmian words and Hopcroft's algorithm, Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments, On the Hopcroft's minimization technique for DFA and DFCA, Bisimilarity Minimization in O(m logn) Time, Average complexity of Moore's and Hopcroft's algorithms, Minimisation of automata, Sorting and doubling techniques for set partitioning and automata minimization problems, Efficient Coalgebraic Partition Refinement, Re-describing an algorithm by Hopcroft, Graph isomorphism problem, Efficient minimization of deterministic weak \(\omega\)-automata
