See Boolean circuit on Wiktionary
{
"forms": [
{
"form": "Boolean circuits",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Boolean circuit (plural Boolean circuits)",
"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"
}
],
"glosses": [
"A directed acyclic graph whose internal nodes are Boolean functions."
],
"id": "en-Boolean_circuit-en-noun-vNd-Nmr9",
"links": [
[
"computer science",
"computer science"
],
[
"computational complexity theory",
"computational complexity theory"
],
[
"directed",
"directed"
],
[
"acyclic",
"acyclic"
],
[
"graph",
"graph"
],
[
"internal",
"internal"
],
[
"node",
"node"
],
[
"Boolean function",
"Boolean function"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) A directed acyclic graph whose internal nodes are Boolean functions."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "Boolean circuit"
}
{
"forms": [
{
"form": "Boolean circuits",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "Boolean circuit (plural Boolean circuits)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Computer science"
],
"glosses": [
"A directed acyclic graph whose internal nodes are Boolean functions."
],
"links": [
[
"computer science",
"computer science"
],
[
"computational complexity theory",
"computational complexity theory"
],
[
"directed",
"directed"
],
[
"acyclic",
"acyclic"
],
[
"graph",
"graph"
],
[
"internal",
"internal"
],
[
"node",
"node"
],
[
"Boolean function",
"Boolean function"
]
],
"qualifier": "computational complexity theory",
"raw_glosses": [
"(computer science, computational complexity theory) A directed acyclic graph whose internal nodes are Boolean functions."
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "Boolean circuit"
}
Download raw JSONL data for Boolean circuit 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 2024-12-01 from the enwiktionary dump dated 2024-11-21 using wiktextract (95d2be1 and 64224ec). 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.