An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A strong-connectivity algorithm and its applications in data flow analysis
- Algorithms for dense graphs and networks on the random access computer
- Depth-First Search and Linear Graph Algorithms
- Hopcroft’s Algorithm and Cyclic Automata
- Hyper-Minimization in O(n 2)
- Hyper-minimizing minimized deterministic finite state automata
- Implementation and Application of Automata
- Minimal NFA Problems are Hard
- Minimal cover-automata for finite languages
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the Hopcroft's minimization technique for DFA and DFCA
- Path-based depth-first search for strong and biconnected components
Cited in
(12)- Hyper-minimization for deterministic tree automata
- Hyper-optimization for deterministic tree automata
- An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
- Limits of exact algorithms for inference of minimum size finite state machines
- Hyper-minimisation Made Efficient
- Hyper-minimizing minimized deterministic finite state automata
- Better hyper-minimization. Not as fast, but fewer errors
- scientific article; zbMATH DE number 1309169 (Why is no real title available?)
- HARD: A hypercube embedding algorithm for state assignment of finite state machines
- Hyper-Minimization in O(n 2)
- Notes on hyper-minimization
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
This page was built for publication: An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637336)
