Pages that link to "Item:Q672727"

The following pages link to An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727):

Displaying 9 items.

• A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
• Re-describing an algorithm by Hopcroft (Q1589443) (← links)
• Minimisation of automata (Q2074212) (← links)
• Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm (Q2271419) (← links)
• Average case analysis of Moore's state minimization algorithm (Q2429348) (← links)
• EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM (Q2941086) (← links)
• Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
• An Implementation of Deterministic Tree Automata Minimization (Q3503900) (← links)
• A note on mc-DFA and its minimization (Q4469160) (← links)