The following pages link to (Q4964025):
Displayed 7 items.
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615) (← links)