Pumping lemma
The fact that in some formal languages any sufficiently long string can be pumped with repetitions of its substring and the result stays in the same formal language.
- from
- Naming
- added
- 2026-10-10
- likes
- 0
similar
-
Lemma Overloading github.com
Demonstration of design patterns for programming and proving with canonical structures.
-
Recursion Schemes, Part V: Hello, Hylomorphisms blog.sumtypeofway.com
-
-
Syntactic sugar en.wikipedia.org
Syntax that makes the language "sweeter" for human use. Usually a shorthand for common operations that can also be expressed in a more verbose form.
-
Whenever dangermouse.net
Language that does things whenever it wants.
-
Naming › Theoretical Computer Science: “The fact that in some formal languages any sufficiently long string can be pumped with repetitions of its substring and the result stays in the same formal language.”