Re-describing an algorithm by Hopcroft
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3854429 (Why is no real title available?)
- scientific article; zbMATH DE number 3856413 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 194781 (Why is no real title available?)
- scientific article; zbMATH DE number 742905 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- A linear time solution to the single function coarsest partition problem
- AUTOMATE, a computing package for automata and finite semigroups
- Algebraic and structural automata theory. Transl. of algebraiczna i structuralna teoria automatów (PWN, Warsaw, 1985)
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
- Describing an algorithm by Hopcroft
- Implementing Quicksort programs
- Minimisation of acyclic deterministic automata in linear time
- Partitioning a graph in \(O(|A|\log_ 2|V|)\)
- Quicksort
- Three Partition Refinement Algorithms
- \textit{Grail}: A C++ library for automata and expressions
Cited in
(36)- On Extremal Cases of Hopcroft’s Algorithm
- Average case analysis of Moore's state minimization algorithm
- Construction of minimal deterministic finite automata from biological motifs
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Cycle-aware minimization of acyclic deterministic finite-state automata
- Description and analysis of a bottom-up DFA minimization algorithm
- Fast brief practical DFA minimization
- Average complexity of Moore's and Hopcroft's algorithms
- Subsequential transducers: a coalgebraic perspective
- Minimisation of automata
- Hopcroft’s Algorithm and Cyclic Automata
- Hopcroft's algorithm and tree-like automata
- A graph theoretic approach to automata minimality
- Bisimilarity Minimization in O(m logn) Time
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
- On the Hopcroft's minimization technique for DFA and DFCA
- Efficient Coalgebraic Partition Refinement
- Around Hopcroft’s Algorithm
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
- Circular Sturmian words and Hopcroft's algorithm
- Distributed coalgebraic partition refinement
- Generic partition refinement and weighted tree automata
- On extremal cases of Hopcroft's algorithm
- Linear kernels and linear-time algorithms for finding large cuts
- A search algorithm for subshift attractors of cellular automata
- Hopcroft’s Minimization Technique: Queues or Stacks?
- Minimal separating sequences for all pairs of states
- From generic partition refinement to weighted tree automata minimization
- An algorithm to compute the character access count distribution for pattern matching algorithms
- A reduction technique for weighted grouping problems
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R
- Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm
- A split-based incremental deterministic automata minimization algorithm
- Efficient and modular coalgebraic partition refinement
- Explicit Hopcroft's trick in categorical partition refinement
- Revisiting Shinohara's algorithm for computing descriptive patterns
This page was built for publication: Re-describing an algorithm by Hopcroft
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589443)
