Pumping lemma for regular languages

Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Pumping lemma for regular languages?

Specifically, the pumping lemma says that for any regular language ${\displaystyle L}$ there exists a constant ${\displaystyle p}$ such that any string ${\displaystyle w}$ in ${\displaystyle L}$ with length at least ${\displaystyle p}$ can be split into three substrings ${\displaystyle x}$, ${\displaystyle y}$ and ${\displaystyle z}$ (${\displaystyle w=xyz}$, with ${\displaystyle y}$ being non-empty), such that the strings ${\displaystyle xz,xyz,xyyz,xyyyz,...}$ constructed by repeating ${\displaystyle y}$ zero or more times are still in ${\displaystyle L}$. This process of repetition is known as "pumping". Moreover, the pumping lemma guarantees that the length of ${\displaystyle xy}$ will be at most ${\displaystyle p}$, imposing a limit on the ways in which ${\displaystyle w}$ may be split.
Languages with a finite number of strings vacuously satisfy the pumping lemma by having ${\displaystyle p}$ equal to the maximum string length in ${\displaystyle L}$ plus one. By doing so, zero strings in ${\displaystyle L}$ have length greater than ${\displaystyle p}$.