The following pages link to (Q4465337):
Displayed 10 items.
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages (Q3533030) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)