Pages that link to "Item:Q2373739"
From MaRDI portal
The following pages link to Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739):
Displaying 7 items.
- Algorithms for path-constrained sequence alignment (Q396718) (← links)
- The tractability frontier for NFA minimization (Q414869) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
