Theoremadvanced
Undecidability of CFL intersection emptiness
The intersection of two context-free languages is not necessarily context-free, and emptiness of intersections is undecidable.
The intersection of two context-free languages is not necessarily context-free, and emptiness of intersections is undecidable.
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 AFJZ2E Edit this page History Report an error