A split-based incremental deterministic automata minimization algorithm
From MaRDI portal
Publication:905684
Recommendations
- Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm
- Implementation and Application of Automata
- An Implementation of Deterministic Tree Automata Minimization
- Incremental DFA minimisation
- Incremental DFA minimisation
- scientific article; zbMATH DE number 2050934
- Minimisation of acyclic deterministic automata in linear time
- SAT-based minimization of deterministic \(\omega \)-automata
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- A First Investigation of Sturmian Trees
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
- Applications of symbolic finite automata
- Average complexity of Moore's and Hopcroft's algorithms
- Describing an algorithm by Hopcroft
- Incremental DFA minimisation
- Re-describing an algorithm by Hopcroft
Cited in
(7)- Incremental DFA minimisation
- Incremental NFA minimization
- How to Split Recursive Automata
- Incremental DFA minimisation
- DFA minimization: double reversal versus split minimization algorithms
- From tree automata to string automata minimization
- Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm
This page was built for publication: A split-based incremental deterministic automata minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905684)
