Theoremcore
Exponential state blowup from regex to DFA
Also called subset construction lower bound for regex.
The regex (a|b)*a(a|b)^(n-1) needs 2^n DFA states, so the conversion can be exponential.
The regex (a|b)*a(a|b)^(n-1) needs 2^n DFA states, so the conversion can be exponential.
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 FQY32P Edit this page History Report an error