Nonregular equal-block language
The language {0ⁿ1ⁿ:n≥0} is not regular.
Key knowledge
The language {0ⁿ1ⁿ:n≥0} is not regular. For any proposed pumping length p choose 0ᵖ1ᵖ. Every split with |uv|≤p and |v|≥1 places v among the zeros; pumping it adds zeros without adding ones, contradicting membership.
Conditions and scope
- The argument covers every allowed decomposition, not a convenient single split.
- This language is context free; nonregular does not mean undecidable.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 5 Example 1 and pumping argument, slide 22 with the bounded-prefix condition.
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-nonregular-equal-blocks
- Revision
- university-core.1
- Structured reference record
- University core expansion