"Kleene closure" meaning in English

See Kleene closure in All languages combined, or Wiktionary

Noun

Forms: Kleene closures [plural]
Etymology: 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. Head templates: {{en-noun}} Kleene closure (plural Kleene closures)
  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.) Wikipedia link: Kleene closure, Stephen Cole Kleene Categories (topical): Computer science, Mathematics

Inflected forms

Download JSON data for Kleene closure meaning in English (2.4kB)

{
  "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": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "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 entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "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"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-03 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.