Pages that link to "Item:Q3617075"
From MaRDI portal
The following pages link to Finding Lower Bounds for Nondeterministic State Complexity Is Hard (Q3617075):
Displayed 21 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- Finite transducers and nondeterministic state complexity of regular languages (Q1956627) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← 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)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615) (← links)