The following pages link to (Q5313785):
Displaying 16 items.
- The state complexity of random DFAs (Q338393) (← links)
- State complexity of power (Q1019718) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- State-complexity hierarchies of uniform languages of alphabet-size length (Q2271458) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- State complexity of regular languages (Q2731279) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- On the Number of Accepting States of Finite Automata (Q3178872) (← links)
- On a Maximal NFA Without Mergible States (Q3434695) (← links)
- Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet (Q3970885) (← links)
- The number of languages with maximum state complexity (Q5918753) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (Q6169895) (← links)
- Block languages and their bitmap representations (Q6666792) (← links)