Pages that link to "Item:Q437674"
From MaRDI portal
The following pages link to Fast brief practical DFA minimization (Q437674):
Displaying 16 items.
- A polynomial double reversal minimization algorithm for deterministic finite automata (Q386994) (← links)
- Cycle-aware minimization of acyclic deterministic finite-state automata (Q496535) (← links)
- From tree automata to string automata minimization (Q722214) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Realization of finite-automaton algorithms by structured programs. II (Q1064781) (← links)
- Sorting and doubling techniques for set partitioning and automata minimization problems (Q1575899) (← links)
- Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← links)
- A minimized automaton representation of reachable states (Q1856175) (← links)
- Minimisation of automata (Q2074212) (← links)
- DFA minimization: double reversal versus split minimization algorithms (Q2342683) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- Weak Minimization of DFA — An Algorithm and Applications (Q3559776) (← links)
- Efficient Minimization of DFAs with Partial Transition Functions (Q4910757) (← links)
- MINIMIZATION OF SYNTAX DIAGRAMS WITH MULTIPORT COMPONENTS (Q5151235) (← links)
- Enumerating permutations sortable by \(k\) passes through a pop-stack (Q5918174) (← links)
- Efficient algorithms for the inference of minimum size DFAs (Q5945683) (← links)
