Pages that link to "Item:Q963396"

The following pages link to Description and analysis of a bottom-up DFA minimization algorithm (Q963396):

Displaying 14 items.

• A graph theoretic approach to automata minimality (Q418805) (← links)
• Fast brief practical DFA minimization (Q437674) (← links)
• Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
• The word problem for \(\omega \)-terms over DA (Q650888) (← links)
• Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
• A new algorithm for the construction of minimal acyclic DFAs. (Q1426028) (← links)
• The \(\kappa\)-word problem over \(\mathsf{DRH}\) (Q1676315) (← links)
• Minimisation of automata (Q2074212) (← links)
• Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
• Weak Minimization of DFA — An Algorithm and Applications (Q3559776) (← links)
• Finding All Minimum-Size DFA Consistent with Given Examples: SAT-Based Approach (Q4989704) (← links)
• Some New Features and Algorithms for the Study of DFA (Q5350465) (← links)
• Efficient algorithms for the inference of minimum size DFAs (Q5945683) (← links)
• Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)