The following pages link to (Q5874553):
Displaying 4 items.
- Complexity of regex crosswords (Q2278278) (← links)
- Succinctness of the Complement and Intersection of Regular Expressions (Q2946652) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)