On the public citation graph
Describing an algorithm by Hopcroft
0 signed · 81 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpa.3160480906openalex-snapshot
Program derivation with verified transformations — a case study
inferred← citeshttps://doi.org/10.1007/11591191_28openalex-snapshot
Experimental Evaluation of Classical Automata Constructions
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_25openalex-snapshot
The use of transformations to implement an algorithm
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_27openalex-snapshot
Directly Constructing Minimal DFAs: Combining Two Algorithms by Brzozowski
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_49openalex-snapshot
How to invent characterizable inference methods for regular languages
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_709openalex-snapshot
Parallel algorithms for finite automata problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_10openalex-snapshot
Parallel Algorithms for Finite Automata Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-9347-4_5openalex-snapshot
Homomorphic Reduction of Coordination Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_18openalex-snapshot
Generic Partition Refinement and Weighted Tree Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_9openalex-snapshot
Distributed Coalgebraic Partition Refinement
inferred← citeshttps://doi.org/10.1007/978-3-031-66438-0_7openalex-snapshot
Explicit Hopcroft’s Trick in Categorical Partition Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_14openalex-snapshot
Minimal Separating Sequences for All Pairs of States
inferred← citeshttps://doi.org/10.1007/978-3-319-94812-6_21openalex-snapshot
Two Routes to Automata Minimization and the Ways to Reach It Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-540-30500-2_30openalex-snapshot
A BDD-Like Implementation of an Automata Package
inferred← citeshttps://doi.org/10.1007/978-3-540-30500-2_4openalex-snapshot
On the Complexity of Hopcroft’s State Minimization Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_9openalex-snapshot
Hopcroft’s Minimization Technique: Queues or Stacks?
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_17openalex-snapshot
Hopcroft’s Algorithm and Cyclic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02424-5_9openalex-snapshot
Bisimilarity Minimization in O(m logn) Time
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_31openalex-snapshot
Hyper-minimisation Made Efficient
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_29openalex-snapshot
The Average Complexity of Moore’s State Minimization Algorithm Is O( n loglogn)
inferred← citeshttps://doi.org/10.1007/978-3-642-22256-6_19openalex-snapshot
Computing All ℓ-Cover Automata Fast
inferred← citeshttps://doi.org/10.1007/978-3-642-22863-6_9openalex-snapshot
Verified Synthesis of Knowledge-Based Programs in Finite Synchronous Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_31openalex-snapshot
On Minimising Automata with Errors
inferred← citeshttps://doi.org/10.1007/bfb0014661openalex-snapshot
Current ideas in programming methodology
inferred← citeshttps://doi.org/10.1007/bfb0031397openalex-snapshot
Sorting and doubling techniques for set partitioning and automata minimization problems
inferred← citeshttps://doi.org/10.1007/s00165-020-00526-zopenalex-snapshot
From generic partition refinement to weighted tree automata minimization
inferred← citeshttps://doi.org/10.1007/s00224-014-9588-yopenalex-snapshot
A Split-Based Incremental Deterministic Automata Minimization Algorithm
inferred← citeshttps://doi.org/10.1007/s00453-011-9557-7openalex-snapshot
Average Case Analysis of Moore’s State Minimization Algorithm
inferred← citeshttps://doi.org/10.1007/s10559-006-0062-yopenalex-snapshot
A software system for growth analysis of mealy automata
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90093-2openalex-snapshot
A practical method for finding the optimum postponement transformation for LR(k) parsers
inferred← citeshttps://doi.org/10.1016/0167-6423(88)90033-0openalex-snapshot
Program derivation by fixed point computation
inferred← citeshttps://doi.org/10.1016/j.dam.2013.08.003openalex-snapshot
Cycle-aware minimization of acyclic deterministic finite-state automata
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.008openalex-snapshot
Subsequential transducers: a coalgebraic perspective
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.01.003openalex-snapshot
Description and analysis of a bottom-up DFA minimization algorithm
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.12.004openalex-snapshot
Fast brief practical DFA minimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.039openalex-snapshot
Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.034openalex-snapshot
On the Hopcroft’s minimization technique for DFA and DFCA
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.018openalex-snapshot
Circular sturmian words and Hopcroft’s algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.011openalex-snapshot
Average complexity of Moore’s and Hopcroft’s algorithms
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00183-6openalex-snapshot
Efficient minimization of deterministic weak -automata
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70010-4openalex-snapshot
3. Minimization of automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00133-8openalex-snapshot
Succinctness of descriptions of SBTA-languages
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00018-3openalex-snapshot
Sorting and doubling techniques for set partitioning and automata minimization problems
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00150-4openalex-snapshot
Re-describing an algorithm by Hopcroft
inferred← citeshttps://doi.org/10.1023/a:1027328830731openalex-snapshot
From Bisimulation to Simulation: Coarsest Partition Problems
inferred← citeshttps://doi.org/10.1109/ipps.1996.508056openalex-snapshot
A parallel algorithm for minimization of finite automata
inferred← citeshttps://doi.org/10.1137/0209025openalex-snapshot
A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
inferred← citeshttps://doi.org/10.1137/0209031openalex-snapshot
On the Computational Complexity of Program Scheme Equivalence
inferred← citeshttps://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferred← citeshttps://doi.org/10.1137/1020067openalex-snapshot
Complexity of Combinatorial Algorithms
inferred← citeshttps://doi.org/10.1142/s0129054112400485openalex-snapshot
UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION
inferred← citeshttps://doi.org/10.1142/s0129054114500282openalex-snapshot
EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM
inferred← citeshttps://doi.org/10.1145/277650.277665openalex-snapshot
Improving data-flow analysis with path profiles
inferred← citeshttps://doi.org/10.1145/277652.277665openalex-snapshot
Improving data-flow analysis with path profiles
inferred← citeshttps://doi.org/10.1145/989393.989451openalex-snapshot
Improving data-flow analysis with path profiles
inferred← citeshttps://doi.org/10.1371/journal.pone.0165864openalex-snapshot
Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information
inferred← citeshttps://doi.org/10.15407/usim.2016.03.061openalex-snapshot
On Automata Minimization by Hopcroft’s Algorithm
inferred← citeshttps://doi.org/10.17760/d20002952openalex-snapshot
Scaling up scientific computations by using map-reduce-like control flow on NUMA architectures
inferred← citeshttps://doi.org/10.23638/lmcs-16(1:8)2020openalex-snapshot
Efficient and Modular Coalgebraic Partition Refinement
inferred← citeshttps://doi.org/10.25911/5d78d9f7865dbopenalex-snapshot
Arrows for knowledge-based circuits
inferred← citeshttps://doi.org/10.3233/fi-2010-369openalex-snapshot
Simple Bisimilarity Minimization in O(m log n) Time
inferred← citeshttps://doi.org/10.4204/eptcs.151.22openalex-snapshot
Hyper-Minimization for Deterministic Weighted Tree Automata
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1822openalex-snapshot
On the Average Complexity of Moore's State Minimization Algorithm
inferred← citeshttps://doi.org/10.46298/dmtcs.3576openalex-snapshot
Hopcroft's automaton minimization algorithm and Sturmian words
inferred← citeshttps://doi.org/10.46298/lmcs-18(4:6)2022openalex-snapshot
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
inferred← citeshttps://doi.org/10.48550/arxiv.0705.1986openalex-snapshot
On the Hopcroft's minimization algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2826openalex-snapshot
Efficient Minimization of DFAs with Partial Transition Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1103.5736openalex-snapshot
Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2012.01546openalex-snapshot
Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence
inferred← citeshttps://doi.org/10.5555/800254.807777openalex-snapshot
DUAL: An interactive tool for developing documented programs by step-wise refinements.
inferred← citeshttps://doi.org/10.70675/91d73837z83c0z4272zbb60zd55d200769efopenalex-snapshot
Génération aléatoire d'automates et analyse d'algorithmes de minimisation
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.