Pages that link to "Item:Q2641868"
From MaRDI portal
The following pages link to Minimizing nfa's and regular expressions (Q2641868):
Displayed 6 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Büchi Automata Can Have Smaller Quotients (Q3012925) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)