The following pages link to (Q3152811):
Displayed 8 items.
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- On the Hopcroft's minimization technique for DFA and DFCA (Q1019723) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- On the descriptional complexity of Watson-Crick automata (Q2271460) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)