See Kleene's theorem on Wiktionary
{
"etymology_text": "Named after mathematician Stephen Cole Kleene.",
"head_templates": [
{
"args": {},
"expansion": "Kleene's theorem",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"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": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A theorem stating that regular expressions are equivalent to finite-state machines."
],
"id": "en-Kleene's_theorem-en-name-deFBJ58y",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"regular expression",
"regular expression"
],
[
"equivalent",
"equivalent"
],
[
"finite-state machine",
"finite-state machine"
]
],
"raw_glosses": [
"(computing theory) A theorem stating that regular expressions are equivalent to finite-state machines."
],
"related": [
{
"word": "Kleene's recursion theorem"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Kleene's theorem"
}
{
"etymology_text": "Named after mathematician Stephen Cole Kleene.",
"head_templates": [
{
"args": {},
"expansion": "Kleene's theorem",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"related": [
{
"word": "Kleene's recursion theorem"
}
],
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"A theorem stating that regular expressions are equivalent to finite-state machines."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"regular expression",
"regular expression"
],
[
"equivalent",
"equivalent"
],
[
"finite-state machine",
"finite-state machine"
]
],
"raw_glosses": [
"(computing theory) A theorem stating that regular expressions are equivalent to finite-state machines."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Kleene's theorem"
}
Download raw JSONL data for Kleene's theorem meaning in All languages combined (1.1kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-01-06 from the enwiktionary dump dated 2025-01-01 using wiktextract (f889f65 and 8fbd9e8). 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.