Last Updated：2025/11/26
Sentence
ある言語が正則でないことを証明するために、彼女は長い文字列の中に中間部分があり、それを取り除いたり何度も繰り返したりしても結果の文字列がその言語に残ると主張する補題（ポンピング補題）を用いて、特定の長い文字列に対して有効な分解が任意の繰り返しに耐えられないことを示した。
Quizzes for review
To prove a language is not regular, she used the pumping lemma to show that no valid decomposition of certain long strings preserves membership under arbitrary repetition.
See correct answer
To prove a language is not regular, she used the pumping lemma to show that no valid decomposition of certain long strings preserves membership under arbitrary repetition.
音声機能が動作しない場合はこちらをご確認ください
Related words
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
計算機科学における補題で、十分に長い文字列の中に、ある部分を削除または繰り返しても元の言語に留まる部分文字列が存在するという性質を示すもの。 / この補題は、ある言語が特定の言語クラス（例えば正規言語でない言語）に属するか否かを判断するために使用される。
Related Words
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
