HYPER-MINIMIZATION IN O(n2)
From MaRDI portal
Publication:3395144
Recommendations
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- scientific article; zbMATH DE number 895368
- The Parameterized Complexity of Maximality and Minimality Problems
- The parameterized complexity of maximality and minimality problems
- Approximation algorithms for minimum norm and ordered optimization problems
- Notes on hyper-minimization
- Minimization and \(\mathbf{NP}\) multifunctions
- scientific article; zbMATH DE number 1256718
Cites work
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- Hyper-minimizing minimized deterministic finite state automata
- Incremental construction of minimal deterministic finite cover automata
- Introduction to algorithms
Cited in
(15)- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
- Hyper-optimization for deterministic tree automata
- Better hyper-minimization. Not as fast, but fewer errors
- OPTIMAL HYPER-MINIMIZATION
- Hyper-Minimization in O(n 2)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Unweighted and weighted hyper-minimization
- A congruence-based perspective on automata minimization algorithms
- More on Minimizing Finite Automata with Errors — Nondeterministic Machines
- Hyper-minimization for deterministic tree automata
- FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS
- Winning strategies for the synchronization game on subclasses of finite automata
- A new notion of regularity: finite state automata accepting graphs
- Weak minimization of DFA -- an algorithm and applications
This page was built for publication: HYPER-MINIMIZATION IN O(n2)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395144)
