Minimisation of automata
From MaRDI portal
Summary: For the entire collection see [Zbl 1470.68001].
Recommendations
Cites work
- A new algorithm for the construction of minimal acyclic DFAs.
- Algorithms for minimization of finite acyclic automata and pattern matching in terms
- Algorithms on Strings
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
- Around Hopcroft’s Algorithm
- Automata Studies. (AM-34)
- Average case analysis of Brzozowski's algorithm
- Average case analysis of Moore's state minimization algorithm
- Average complexity of Moore's and Hopcroft's algorithms
- Brzozowski algorithm is generically super-polynomial for deterministic automata
- Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
- Circular Sturmian words and Hopcroft's algorithm
- Comments on ``Incremental construction and maintenance of minimal finite-state automata
- Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
- Describing an algorithm by Hopcroft
- Description and analysis of a bottom-up DFA minimization algorithm
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Fast brief practical DFA minimization
- Generic-case complexity, decision problems in group theory, and random walks.
- Hopcroft’s Algorithm and Cyclic Automata
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 58314 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1962788 (Why is no real title available?)
- scientific article; zbMATH DE number 1886068 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Implementation and Application of Automata
- Incremental Construction and Maintenance of Minimal Finite-State Automata
- Incremental Construction of Minimal Acyclic Finite-State Automata
- Magic numbers and ternary alphabet
- Minimal NFA Problems are Hard
- Minimisation of acyclic deterministic automata in linear time
- Minimization of symbolic automata
- Minimizing finite automata is computationally hard
- Minimizing nfa's and regular expressions
- On Simon's string searching algorithm
- On the average complexity of Moore's state minimization algorithm
- On the Hopcroft's minimization technique for DFA and DFCA
- On the State Minimization of Nondeterministic Finite Automata
- Optimal insertion in deterministic DAWGs
- Re-describing an algorithm by Hopcroft
- Sturmian trees
- The smallest automaton recognizing the subwords of a text
- The tractability frontier for NFA minimization
- The universal automaton
- Transducers and repetitions
Cited in
(26)- Sorting and doubling techniques for set partitioning and automata minimization problems
- Two routes to automata minimization and the ways to reach it efficiently
- Coalgebraic minimization of automata by initiality and finality
- Minimal and Reduced Reversible Automata
- A challenging family of automata for classical minimization algorithms
- Closure properties of hyper-minimized automata
- Automata with Extremal Minimality Conditions
- On Extremal Cases of Hopcroft’s Algorithm
- scientific article; zbMATH DE number 4108164 (Why is no real title available?)
- scientific article; zbMATH DE number 4108165 (Why is no real title available?)
- Minimization of Incompletely Specified Sequential Machines
- Nondeterministic Moore automata and Brzozowski's minimization algorithm
- scientific article; zbMATH DE number 2040922 (Why is no real title available?)
- scientific article; zbMATH DE number 1775629 (Why is no real title available?)
- scientific article; zbMATH DE number 6917169 (Why is no real title available?)
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- Epichristoffel Words and Minimization of Moore Automata
- Brzozowski's minimization algorithm -- more robust than expected (extended abstract)
- scientific article; zbMATH DE number 6300100 (Why is no real title available?)
- Minimizing Generalized Büchi Automata
- Implementation and Application of Automata
- Quantum algorithm for lexicographically minimal string rotation
- Minimization of automata for liveness languages
- Incremental dead state detection in logarithmic time
- Elementary fractal geometry. V: Weak separation is strong separation
- Average complexity of Moore's and Hopcroft's algorithms
This page was built for publication: Minimisation of automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074212)
