Last Updated：2025/12/04
(mathematics, computer science) The set of all strings of finite length made up of elements of a given set. (Then the Kleene closure is said to be of that given set. For a given set S, its Kleene closure may be denoted as S*. The Kleene closure includes a string of zero length. Strings are equivalent to ordered tuples but written without the parentheses and commas.)
音声機能が動作しない場合はこちらをご確認ください
See correct answer
Kleene closure
Edit Histories（0）
Source Word
Kleene closure
Noun
(mathematics,
computer
science)
The
set
of
all
strings
of
finite
length
made
up
of
elements
of
a
given
set.
(Then
the
Kleene
closure
is
said
to
be
of
that
given
set.
For
a
given
set
S,
its
Kleene
closure
may
be
denoted
as
S^*.
The
Kleene
closure
includes
a
string
of
zero
length.
Strings
are
equivalent
to
ordered
tuples
but
written
without
the
parentheses
and
commas.)
Japanese Meaning
数学や計算機科学において、ある与えられた集合に含まれる要素から構成される、有限長のすべての文字列の集合を指します。この集合には空文字列（長さ0の文字列）も含まれることが特徴です。
Sense（1）
(mathematics,
computer
science)
The
set
of
all
strings
of
finite
length
made
up
of
elements
of
a
given
set.
(Then
the
Kleene
closure
is
said
to
be
of
that
given
set.
For
a
given
set
S,
its
Kleene
closure
may
be
denoted
as
S^*.
The
Kleene
closure
includes
a
string
of
zero
length.
Strings
are
equivalent
to
ordered
tuples
but
written
without
the
parentheses
and
commas.)
（ plural ）
