Source Word
pumping lemma
Noun
(computer
science)
A
lemma
which
states
that
for
a
language
to
be
a
member
of
a
language
class
any
sufficiently
long
string
in
the
language
contains
a
section
that
can
be
removed
or
repeated
any
number
of
times
with
the
resulting
string
remaining
in
the
language,
used
to
determine
if
a
particular
language
is
in
a
given
language
class
(e.g.
not
regular).
Japanese Meaning
計算機科学における補題で、十分に長い文字列の中に、ある部分を削除または繰り返しても元の言語に留まる部分文字列が存在するという性質を示すもの。 / この補題は、ある言語が特定の言語クラス（例えば正規言語でない言語）に属するか否かを判断するために使用される。
Sense（1）
(computer
science)
A
lemma
which
states
that
for
a
language
to
be
a
member
of
a
language
class
any
sufficiently
long
string
in
the
language
contains
a
section
that
can
be
removed
or
repeated
any
number
of
times
with
the
resulting
string
remaining
in
the
language,
used
to
determine
if
a
particular
language
is
in
a
given
language
class
(e.g.
not
regular).
（ plural ）
（ plural ）
