Regular-language pumping lemma
If a language is regular, some p≥1 ensures every accepted word x with |x|≥p decomposes as uvw with |uv|≤p, |v|≥1 and uvᵐw accepted for all m≥0.
Key knowledge
If a language is regular, some p≥1 ensures every accepted word x with |x|≥p decomposes as uvw with |uv|≤p, |v|≥1 and uvᵐw accepted for all m≥0. To prove nonregularity one must defeat every permitted decomposition of a chosen word.
Conditions and scope
- The decomposition can depend on x; the pumping exponent is arbitrary.
- This is a necessary condition for regularity, not a sufficient test.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 5 slides 18–21, repeated-state proof and bounded-prefix qualification.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-regular-pumping-lemma
- Revision
- university-core.1
- Structured reference record
- University core expansion