Minimalizations of NFA using the universal automaton
From MaRDI portal
Recommendations
Cited in
(9)- A universality theorem for the sequential behaviour of minimal F-automata
- The universal automaton
- On the Size of the Universal Automaton of a Regular Language
- Minimal NFA and biRFSA Languages
- Minimal NFA problems are hard
- The tractability frontier for NFA minimization
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
- Approximate NFA universality and related problems motivated by information theory
- Universal automata and NFA learning
This page was built for publication: Minimalizations of NFA using the universal automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464002)