Theoremadvanced
PSPACE-completeness of regex equivalence
Also called Meyer-Stockmeyer theorem for regex equivalence.
Regex equivalence is PSPACE-complete, even for restricted regex syntaxes.
Regex equivalence is PSPACE-complete, even for restricted regex syntaxes.
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 C3A5C0 Edit this page History Report an error