Pages that link to "Item:Q6163615"
From MaRDI portal
The following pages link to A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615):
Displaying 6 items.
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)