Theoremadvanced
Determinization blow-up lower bound
Also called exponential blow-up of determinization, 2^n lower bound for subset construction.
Some n-state NFAs require 2^n states in any equivalent DFA, so subset construction is worst-case optimal.
Some n-state NFAs require 2^n states in any equivalent DFA, so subset construction is worst-case optimal.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag QVTCWG Edit this page History Report an error