Pages that link to "Item:Q5428217"
From MaRDI portal
The following pages link to Descriptional Complexity of Nondeterministic Finite Automata (Q5428217):
Displaying 6 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Incomplete operational transition complexity of regular languages (Q498392) (← links)
- Finite transducers and nondeterministic state complexity of regular languages (Q1956627) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
