"Kleene closure" meaning in English

{
  "etymology_text": "Named in honor of Stephen Cole Kleene (1909–1994), an American mathematician. The “closure” part comes from the fact that a Kleene closure is closed with respect to concatenation; cf. free monoid.",
  "forms": [
    {
      "form": "Kleene closures",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Kleene closure (plural Kleene closures)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "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.)"
      ],
      "id": "en-Kleene_closure-en-noun-G6LXGE9p",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computer science",
          "computer science"
        ]
      ],
      "raw_glosses": [
        "(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.)"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Kleene closure",
        "Stephen Cole Kleene"
      ]
    }
  ],
  "word": "Kleene closure"
}

{
  "etymology_text": "Named in honor of Stephen Cole Kleene (1909–1994), an American mathematician. The “closure” part comes from the fact that a Kleene closure is closed with respect to concatenation; cf. free monoid.",
  "forms": [
    {
      "form": "Kleene closures",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Kleene closure (plural Kleene closures)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science",
        "en:Mathematics"
      ],
      "glosses": [
        "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.)"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "computer science",
          "computer science"
        ]
      ],
      "raw_glosses": [
        "(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.)"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Kleene closure",
        "Stephen Cole Kleene"
      ]
    }
  ],
  "word": "Kleene closure"
}