See pushdown automaton in All languages combined, or Wiktionary
Download JSON data for pushdown automaton meaning in English (3.0kB)
{
"forms": [
{
"form": "pushdown automata",
"tags": [
"plural"
]
},
{
"form": "pushdown automatons",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "pushdown automata",
"2": "s"
},
"expansion": "pushdown automaton (plural pushdown automata or pushdown automatons)",
"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 topic categories using raw markup",
"parents": [
"Entries with topic 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": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"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": [
"An automaton with finitely many states that can also use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA."
],
"id": "en-pushdown_automaton-en-noun-VKK7xaS1",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"finitely",
"finitely"
],
[
"state",
"state"
],
[
"stack",
"stack"
],
[
"top",
"top"
],
[
"PDA",
"PDA"
]
],
"raw_glosses": [
"(computing theory) An automaton with finitely many states that can also use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA."
],
"related": [
{
"word": "Turing machine"
},
{
"word": "cellular automaton"
},
{
"word": "unlimited register machine"
},
{
"word": "context-free grammar"
}
],
"synonyms": [
{
"word": "pushdown"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "automaton",
"word": "下推自動機"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "xiàtuī zìdòngjī",
"sense": "automaton",
"word": "下推自动机"
},
{
"code": "cs",
"lang": "Czech",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "zásobníkový automat"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "automaton",
"word": "pinoautomaatti"
},
{
"code": "de",
"lang": "German",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "Kellerautomat"
},
{
"code": "pl",
"lang": "Polish",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "automat ze stosem"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "potisni automat"
}
],
"wikipedia": [
"pushdown automaton"
]
}
],
"word": "pushdown automaton"
}
{
"forms": [
{
"form": "pushdown automata",
"tags": [
"plural"
]
},
{
"form": "pushdown automatons",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "pushdown automata",
"2": "s"
},
"expansion": "pushdown automaton (plural pushdown automata or pushdown automatons)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "Turing machine"
},
{
"word": "cellular automaton"
},
{
"word": "unlimited register machine"
},
{
"word": "context-free grammar"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English entries with topic categories using raw markup",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with non-redundant non-automated sortkeys",
"en:Mathematics",
"en:Theory of computing"
],
"glosses": [
"An automaton with finitely many states that can also use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"finitely",
"finitely"
],
[
"state",
"state"
],
[
"stack",
"stack"
],
[
"top",
"top"
],
[
"PDA",
"PDA"
]
],
"raw_glosses": [
"(computing theory) An automaton with finitely many states that can also use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA."
],
"synonyms": [
{
"word": "pushdown"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"pushdown automaton"
]
}
],
"translations": [
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "automaton",
"word": "下推自動機"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "xiàtuī zìdòngjī",
"sense": "automaton",
"word": "下推自动机"
},
{
"code": "cs",
"lang": "Czech",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "zásobníkový automat"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "automaton",
"word": "pinoautomaatti"
},
{
"code": "de",
"lang": "German",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "Kellerautomat"
},
{
"code": "pl",
"lang": "Polish",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "automat ze stosem"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "potisni automat"
}
],
"word": "pushdown automaton"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 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.