Learner Pump Lemma

• Learner Pump Lemma is a learner-oriented reformulation of the pumping lemma that emphasizes interactive experimentation and computed witness decompositions in regular languages.
• The approach uses the MIPU tool to generate strings, test language membership, and automatically determine the minimum pumping length with valid x,y,z decompositions.
• It addresses conceptual obstacles in understanding regular language properties by shifting from static presentation to active, hands-on learning with automated verification.

“Learner Pump Lemma” (Editor’s term) denotes a learner-oriented treatment of the pumping lemma for regular languages in which the theorem is studied through interactive experimentation rather than only through static presentation^^^^1^^^^ In the current arXiv literature represented here, the clearest realization of that approach is MIPU (“MInimum PUmping length”), an educational software system designed to help students explore language membership, generate short strings in a regular language, and automatically calculate the minimum pumping length together with a witness decomposition^^^^1^^^^ The software is explicitly framed as an active-learning aid for a topic that is widely regarded as difficult to teach and difficult to learn in theoretical computer science courses (Rivera et al., 2023)^^^^1^^^^

1^^^^1^^^^ Formal basis: pumping, decomposition, and minimum pumping length

The formal core is the standard pumping lemma for regular languages^^^^1^^^^ For a regular language $L$, there exists a positive integer $p$ such that every string $w \in L$ with $|w| \ge p$ can be written as

$w = xyz$

with

$|y| > 0,$

$|xy| \le p,$

and

$\forall i \ge 0,\; xy^i z \in L.$

In the MIPU paper, this is the theorem students are meant to operationalize rather than merely memorize (Rivera et al., 2023)^^^^1^^^^

A central pedagogical refinement is the notion of minimum pumping length^^^^1^^^^ In the implementation-oriented formulation used for MIPU, this is the least positive integer $p$ such that

$$\forall w \in L,\; |w| \ge p \implies \exists x,y,z \text{ with } w=xyz,\; |y|>0,\; |xy|\le p,\; \forall i\ge 0,\; xy^i z \in L.$$

This converts the existential statement “some pumping length exists” into a concrete threshold that can be computed, inspected, and compared with actual strings and decompositions (Rivera et al., 2023)^^^^1^^^^

Within this learner-centered framing, the pumping lemma is not treated only as a nonregularity proof technique^^^^1^^^^ It is also treated as a structural property of regular languages, with particular emphasis on how strings are split into $p$0, why $p$1 must be nonempty, why $p$2, and how repeated or deleted occurrences of $p$3 preserve membership (Rivera et al., 2023)^^^^1^^^^

2^^^^1^^^^ Pedagogical motivation and conceptual obstacles

The educational problem identified in the MIPU work is not that the theorem cannot be stated, but that students often lack enough guided practice and tool support to build a usable mental model of what the statement means^^^^1^^^^ The paper emphasizes that the pumping lemma is hard to visualize through traditional lecture or textbook presentation, that the topic is highly theoretical, and that students generally need to examine many cases before intuition forms (Rivera et al., 2023)^^^^1^^^^

Several recurring obstacles are singled out^^^^1^^^^ Students may know the theorem syntactically while lacking a clear understanding of what the pumping length is supposed to do^^^^1^^^^ They may also struggle with decomposition $p$4, especially with the constraints that $p$5 must be nonempty and $p$6 must lie within the first $p$7 symbols^^^^1^^^^ Another obstacle is the operational meaning of “pumping”: students must see, through examples, why strings such as $p$8, $p$9, and $w \in L$0 remain in the language when the language is regular^^^^1^^^^ The paper also notes that these difficulties interfere with the later use of pumping arguments in proofs that a language is not regular (Rivera et al., 2023)^^^^1^^^^

The paper explicitly contrasts passive instruction with active learning^^^^1^^^^ Rather than only reading the lemma, students are meant to interact with regular expressions, finite automata, strings, decompositions, and pumping behavior^^^^1^^^^ In that sense, the learner-oriented pumping-lemma paradigm is a change in epistemic mode: the student becomes an actor in the learning process through hands-on experimentation (Rivera et al., 2023)^^^^1^^^^

A further motivation is tool coverage^^^^1^^^^ The paper mentions JFLAP as an important hands-on automata tool, but argues that it does not support minimum pumping length computation or features specifically aimed at understanding the pumping-lemma property^^^^1^^^^ MIPU is therefore positioned as complementary to existing automata-learning systems rather than as a replacement for them (Rivera et al., 2023)^^^^1^^^^

3^^^^1^^^^ MIPU architecture, interface, and workflow

MIPU takes a regular language specified by a regular expression, converts it into an NFA, and exposes three learner-centered modules^^^^1^^^^ The software’s architecture is object-oriented and consists of four major components: a regular-expression-to-NFA converter, an NFA simulator, a Language’s Strings Generator (LSG), and a Minimum Pumping Length Determiner (Rivera et al., 2023)^^^^1^^^^

The NFA is represented as the standard 5-tuple

$w \in L$1

where $w \in L$2 is the finite set of states, $w \in L$3 is the alphabet, $w \in L$4 is the transition function, $w \in L$5 is the start state, and $w \in L$6 is the set of accept states^^^^1^^^^ The implementation includes a regular-expression-to-NFA converter, an NFA simulator, and epsilon-transition handling; the paper also provides algorithms for regex-to-NFA conversion, acceptance testing, state transition, and epsilon-transition updating (Rivera et al., 2023)^^^^1^^^^

Module	Input	Output
Membership Testing	Regular expression and input string	Whether the string belongs to the language
String Generation	Regular expression	Short accepted strings, ordered from shortest to longest
Minimum Pumping Length	Regular expression	Minimum pumping length, witness string, and $w \in L$7 decomposition

The GUI organizes these modules as Membership Testing, String Generation, and Minimum Pumping Length^^^^1^^^^ This arrangement mirrors the intended learning progression: first understand the language, then inspect representative strings, and finally examine pumping behavior and pumping length^^^^1^^^^ A typical workflow is to enter a regular expression, test candidate strings for membership, generate short strings to inspect the language’s structure, and then compute the minimum pumping length together with a witness decomposition (Rivera et al., 2023)^^^^1^^^^

The implementation also imposes notation restrictions^^^^1^^^^ The software reserves "U" for union, "^^^^1^^^^" for concatenation, "*" for star, a backslash-like symbol for the empty language, and "e" for epsilon^^^^1^^^^ These reserved characters cannot simultaneously serve as ordinary alphabet symbols in a regular expression, and the paper identifies this as a target for future improvement (Rivera et al., 2023)^^^^1^^^^

4^^^^1^^^^ Functional semantics: membership, string generation, and computed witnesses

The first functionality is membership testing^^^^1^^^^ A student enters a regular expression and an input string, and the tool determines whether the string belongs to the language^^^^1^^^^ Pedagogically, this makes the condition

$w \in L$8

concrete, because a student can test pumped variants directly^^^^1^^^^ The paper gives the example of regular expression

$w \in L$9

with input string

$|w| \ge p$0

for which the tool returns True^^^^1^^^^ Another example uses

$|w| \ge p$1

with input string

$|w| \ge p$2

and the tool reports that the string belongs to the language (Rivera et al., 2023)^^^^1^^^^

The second functionality is the Language’s Strings Generator^^^^1^^^^ It produces short accepted strings ordered from shortest to longest^^^^1^^^^ Technically, the LSG uses the NFA for the regular expression, generates permutations from the alphabet, keeps only accepted strings, and can dynamically produce more strings when requested^^^^1^^^^ The paper notes an optimization based on tracking branches of a permutation tree and pruning branches unlikely to lead to accepting states (Rivera et al., 2023)^^^^1^^^^

This generator is pedagogically important because students often do not fully understand what language a regular expression denotes before they try to reason about pumping^^^^1^^^^ For one regular expression, the paper lists strings such as "1", "01", "10", "11", "000", "001", and "010"^^^^1^^^^ For

$|w| \ge p$3

the generated strings include "00", "001", "010", "100", "0011", "0^^^^4U4^^^^", "0110", "1001", "^^^^4U4^^^^0", and "1100"^^^^1^^^^ These examples make visible the distinction between the shortest strings in the language and the shortest strings relevant to pumping (Rivera et al., 2023)^^^^1^^^^

The third functionality, and the paper’s most distinctive one, is automatic computation of the minimum pumping length^^^^1^^^^ The Minimum Pumping Length Determiner uses the NFA, strings generated by the LSG, and membership tests to verify pumping conditions^^^^1^^^^ The procedure described in the paper is to generate strings in the language in increasing order of length, test the pumping-lemma conditions, identify the smallest threshold that works, and return one of the shortest strings satisfying the conditions together with a partition into $|w| \ge p$4, $|w| \ge p$5, and $|w| \ge p$6 (Rivera et al., 2023)^^^^1^^^^

Three examples are central^^^^1^^^^ For

$|w| \ge p$7

MIPU reports minimum pumping length $|w| \ge p$8, minimum string "^^^^4U4^^^^", and decomposition $|w| \ge p$9, $w = xyz$0, $w = xyz$1^^^^1^^^^ For

$w = xyz$2

it reports minimum pumping length $w = xyz$3, minimum string "001", and decomposition $w = xyz$4, $w = xyz$5, $w = xyz$6^^^^1^^^^ The paper emphasizes that "00" is the shortest generated string in the language but cannot be pumped, so it is not the minimum string witnessing the pumping property^^^^1^^^^ For

$w = xyz$7

MIPU reports minimum pumping length $w = xyz$8, minimum string "a", and decomposition $w = xyz$9, $|y| > 0,$0, $|y| > 0,$1 (Rivera et al., 2023)^^^^1^^^^

These examples show why the minimum pumping length feature is pedagogically strong^^^^1^^^^ It instantiates three objects simultaneously: a threshold $|y| > 0,$2, a witness string at or beyond that threshold, and a valid decomposition satisfying the theorem’s constraints (Rivera et al., 2023)^^^^1^^^^

5^^^^1^^^^ Educational significance, limitations, and unresolved evaluation

The educational significance claimed for MIPU is conceptual rather than experimental^^^^1^^^^ The paper states that the software was developed to provide educational assistance, to help students better understand the pumping lemma and minimum pumping length, and to promote active learning through hands-on practice^^^^1^^^^ It also presents the tool as a means for helping students move from the formal statement of the lemma to an operational understanding grounded in membership queries, generated examples, and explicit decompositions (Rivera et al., 2023)^^^^1^^^^

At the same time, the paper does not report a formal empirical classroom study with measured learning gains, controlled experiments, or statistical evaluation^^^^1^^^^ The educational outcomes are therefore presented as intended benefits and expected effects rather than experimentally validated results^^^^1^^^^ This is an important limitation in interpreting the paper’s contribution: it introduces a pedagogical instrument and a workflow, but not a quantitative efficacy study (Rivera et al., 2023)^^^^1^^^^

The authors also identify several implementation limitations^^^^1^^^^ The current version does not yet visualize the regex-to-NFA conversion process, does not yet provide a direct pumping-operation function in which a user explicitly pumps a string a chosen number of times, restricts certain special characters because of reserved regex notation, and could improve string-generation performance by traversing the NFA directly rather than using a permutation tree^^^^1^^^^ GUI improvements, especially for dynamic string generation, are also mentioned as future work (Rivera et al., 2023)^^^^1^^^^

A plausible implication is that the learner-oriented pumping-lemma approach can be strengthened further by making pumping itself more interactive and by making automaton construction more visible^^^^1^^^^ That implication follows from the paper’s own diagnosis of what students find difficult: decomposition, repeated experimentation, and the need to inspect many concrete cases (Rivera et al., 2023)^^^^1^^^^

6^^^^1^^^^ Position within the broader pumping-lemma literature

The learner-oriented treatment represented by MIPU belongs to a much larger pumping-lemma landscape^^^^1^^^^ Outside this pedagogical setting, the cited arXiv literature develops pumping lemmas and related substitutes for a range of formalisms, usually not as learning tools but as structural and non-membership techniques^^^^1^^^^

For context-free languages, one line of work gives a direct proof of the Bar-Hillel lemma from pushdown automata rather than from context-free grammars and Ogden’s lemma, emphasizing repeated patterns in PDA computations and the decomposition

$|y| > 0,$3

(Amarilli et al., 2012)^^^^1^^^^ A complementary survey treats the pumping lemma through Chomsky normal form and derivation trees, with repeated nonterminals along a long root-to-leaf path as the source of the pumpable structure, and explicitly positions Ogden’s lemma as a stronger instrument (Gullà, 2024)^^^^1^^^^

Beyond ordinary context-free languages, Sorokin proves a stronger pumping lemma and a weak Ogden lemma for displacement context-free languages, equivalently well-nested multiple context-free languages^^^^1^^^^ The decomposition there has the form

$|y| > 0,$4

with synchronized pumping of multiple zones, a bounded pumped region, and applications showing that languages such as $|y| > 0,$5 and $|y| > 0,$6 are not tree-adjoining languages (Sorokin, 2014)^^^^1^^^^

Higher in the hierarchy, a pumping lemma for higher-order grammars yields, under a higher-order Kruskal-style conjecture, strictly embedded infinite sequences of trees or words with size bounds of the form $|y| > 0,$7 or $|y| > 0,$8; the order-2 case is proved unconditionally, which yields pumping lemmas for order-2 tree languages and order-3 word languages (Asada et al., 2017)^^^^1^^^^ Specialized synchronized pumping also appears for folding systems, where the relevant lemmas guarantee fixed infinite pumpable subfamilies with two, four, or six synchronized pumped blocks depending on whether the core and folding procedure languages are regular or context-free (Lucero, 2019)^^^^1^^^^

Other work modifies the pumping paradigm itself^^^^1^^^^ Swapping lemmas for regular and context-free languages replace length-changing pumping by length-preserving recombination, a change motivated by advice classes such as $|y| > 0,$9 and $|xy| \le p,$0, where ordinary pumping interacts badly with length-dependent advice (0808.4122)^^^^1^^^^ Pumping lemmas for $|xy| \le p,$1-rated linear languages impose exact ratio constraints on the two pumped regions, and a separate lemma for non-metalinear context-free languages permits pumping in arbitrarily many places (Horváth et al., 2010)^^^^1^^^^ Most recently, a pumping-like lemma for one-register alternating finite-memory automata over infinite alphabets replaces literal repetition by iterated application of a $|xy| \le p,$2-permutation,

$|xy| \le p,$3

and yields an effective semilinearity result for accepted word lengths (Danieli, 29 Dec 2025)^^^^1^^^^

Against that backdrop, the learner-oriented pumping lemma is distinguished not by a new formal-language theorem but by a pedagogical reconfiguration of an existing one^^^^1^^^^ Its contribution is to make the statement

$|xy| \le p,$4

operationally inspectable through language membership, ordered string generation, and computed witness decompositions^^^^1^^^^ In the cited literature, that is the specific role played by MIPU: it translates a difficult theorem into an exploratory environment for learning regular-language structure and pumpability (Rivera et al., 2023)^^^^1^^^^