Problemcore
CFG finiteness problem
Decide whether a context-free grammar generates finitely many strings.
Decide whether a context-free grammar generates finitely many strings.
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 DG1K4Y Edit this page History Report an error