Pages that link to "Item:Q671381"
From MaRDI portal
The following pages link to A lower bound technique for the size of nondeterministic finite automata (Q671381):
Displaying 21 items.
- Finite Automata, Palindromes, Powers, and Patterns (Q3540097) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Magic Numbers and Ternary Alphabet (Q3637234) (← links)
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA (Q3646172) (← links)
- (Q4611380) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- (Q5089218) (← links)
- THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427) (← links)
- NONDETERMINISTIC BIAUTOMATA AND THEIR DESCRIPTIONAL COMPLEXITY (Q5173289) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
- Complement on Free and Ideal Languages (Q5500692) (← links)
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377) (← links)
- Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)
- Regular expression length via arithmetic formula complexity (Q5918469) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615) (← links)
- On Usefulness of Information: Framework and NFA Case (Q6163619) (← links)
