X-machine in English

[Show JSON for postprocessed kaikki.org data shown on this page ▼] [Hide JSON for postprocessed kaikki.org data shown on this page ▲]

{
  "forms": [
    {
      "form": "X-machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "X-machine (plural X-machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A theoretical computer that operates on some fundamental data type X. It is a structurally the same as a finite-state machine, but each transition represents the application of a relation of type X→X."
      ],
      "id": "en-X-machine-en-noun-u9sSnSwz",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "theoretical",
          "theoretical"
        ],
        [
          "computer",
          "computer"
        ],
        [
          "fundamental",
          "fundamental"
        ],
        [
          "data type",
          "data type"
        ],
        [
          "finite-state machine",
          "finite-state machine"
        ],
        [
          "transition",
          "transition"
        ],
        [
          "application",
          "application"
        ],
        [
          "relation",
          "relation"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A theoretical computer that operates on some fundamental data type X. It is a structurally the same as a finite-state machine, but each transition represents the application of a relation of type X→X."
      ],
      "synonyms": [
        {
          "word": "Eilenberg machine"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "X-machine"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "forms": [
    {
      "form": "X-machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "X-machine (plural X-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",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "A theoretical computer that operates on some fundamental data type X. It is a structurally the same as a finite-state machine, but each transition represents the application of a relation of type X→X."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "theoretical",
          "theoretical"
        ],
        [
          "computer",
          "computer"
        ],
        [
          "fundamental",
          "fundamental"
        ],
        [
          "data type",
          "data type"
        ],
        [
          "finite-state machine",
          "finite-state machine"
        ],
        [
          "transition",
          "transition"
        ],
        [
          "application",
          "application"
        ],
        [
          "relation",
          "relation"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A theoretical computer that operates on some fundamental data type X. It is a structurally the same as a finite-state machine, but each transition represents the application of a relation of type X→X."
      ],
      "synonyms": [
        {
          "word": "Eilenberg machine"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "X-machine"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2026-09-09 from the enwiktionary dump dated 2026-09-02 using wiktextract (ccec6f1 and 4deed51). 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.

"X-machine" meaning in English

Noun

Inflected forms