This document discusses the pumping lemma and its application to proving that a specific language is not regular. It states that for any infinite regular language L, there exists an integer m such that any string w in L of length at least m can be written as the concatenation of three strings where the length of the middle string is bounded and the concatenation of the strings is also in L. It then presents a language consisting of strings of a's of length at least 3 and aims to show this language is not regular by assuming for contradiction that it is regular and applying the pumping lemma.
2. 2
Given a infinite regular language
L
there exists an integer
m
for any string with length
Lw mw ||
we can write
zyxw
with and
myx || 1|| y
such that:
Lzyx i
...,2,1,0i
