See finite-state machine in All languages combined, or Wiktionary
{
"forms": [
{
"form": "finite-state machines",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "finite-state machine (plural finite-state machines)",
"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": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Finnish translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Romanian translations",
"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 formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another."
],
"id": "en-finite-state_machine-en-noun-T7CHpbEd",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"formalism",
"formalism"
],
[
"computation",
"computation"
],
[
"finite",
"finite"
],
[
"state",
"state"
],
[
"transition function",
"transition function"
]
],
"raw_glosses": [
"(computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another."
],
"synonyms": [
{
"word": "finite-state automaton"
},
{
"word": "state machine"
},
{
"word": "finite automaton"
},
{
"word": "automaton"
},
{
"tags": [
"initialism"
],
"word": "FSM"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "formalism for describing computation",
"word": "tilakone"
},
{
"code": "fr",
"lang": "French",
"sense": "formalism for describing computation",
"tags": [
"masculine"
],
"word": "automate fini"
},
{
"code": "de",
"lang": "German",
"sense": "formalism for describing computation",
"tags": [
"masculine"
],
"word": "endlicher Automat"
},
{
"code": "de",
"lang": "German",
"sense": "formalism for describing computation",
"tags": [
"masculine"
],
"word": "Zustandsautomat"
},
{
"code": "de",
"lang": "German",
"sense": "formalism for describing computation",
"tags": [
"feminine"
],
"word": "Zustandsmaschine"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "formalism for describing computation",
"tags": [
"neuter"
],
"word": "automat finit"
}
]
}
],
"word": "finite-state machine"
}
{
"forms": [
{
"form": "finite-state machines",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "finite-state machine (plural finite-state machines)",
"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",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Finnish translations",
"Terms with French translations",
"Terms with German translations",
"Terms with Romanian translations",
"en:Theory of computing"
],
"glosses": [
"A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"formalism",
"formalism"
],
[
"computation",
"computation"
],
[
"finite",
"finite"
],
[
"state",
"state"
],
[
"transition function",
"transition function"
]
],
"raw_glosses": [
"(computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another."
],
"synonyms": [
{
"word": "finite-state automaton"
},
{
"word": "state machine"
},
{
"word": "finite automaton"
},
{
"word": "automaton"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"synonyms": [
{
"tags": [
"initialism"
],
"word": "FSM"
}
],
"translations": [
{
"code": "fi",
"lang": "Finnish",
"sense": "formalism for describing computation",
"word": "tilakone"
},
{
"code": "fr",
"lang": "French",
"sense": "formalism for describing computation",
"tags": [
"masculine"
],
"word": "automate fini"
},
{
"code": "de",
"lang": "German",
"sense": "formalism for describing computation",
"tags": [
"masculine"
],
"word": "endlicher Automat"
},
{
"code": "de",
"lang": "German",
"sense": "formalism for describing computation",
"tags": [
"masculine"
],
"word": "Zustandsautomat"
},
{
"code": "de",
"lang": "German",
"sense": "formalism for describing computation",
"tags": [
"feminine"
],
"word": "Zustandsmaschine"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "formalism for describing computation",
"tags": [
"neuter"
],
"word": "automat finit"
}
],
"word": "finite-state machine"
}
Download raw JSONL data for finite-state machine meaning in English (2.3kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). 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.