Pages that link to "Item:Q1426028"
From MaRDI portal
The following pages link to A new algorithm for the construction of minimal acyclic DFAs. (Q1426028):
Displaying 8 items.
- From tree automata to string automata minimization (Q722214) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Minimisation of acyclic deterministic automata in linear time (Q1190464) (← links)
- Minimisation of automata (Q2074212) (← links)
- How to squeeze a lexicon (Q2783368) (← links)
- On-line construction of a small automaton for a finite set of words (Q2909196) (← links)
- Some New Features and Algorithms for the Study of DFA (Q5350465) (← links)
- Efficient algorithms for the inference of minimum size DFAs (Q5945683) (← links)