The following pages link to (Q4503150):
Displayed 5 items.
- Extremal minimality conditions on automata (Q441884) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)