"Büchi automaton" meaning in All languages combined

{
  "etymology_text": "Named after the Swiss mathematician Julius Richard Büchi, who invented this kind of automaton in 1962.",
  "forms": [
    {
      "form": "Büchi automatons",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "Büchi automata",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "s",
        "2": "Büchi automata"
      },
      "expansion": "Büchi automaton (plural Büchi automatons or Büchi automata)",
      "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": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A type of ω-automaton that extends a finite automaton to infinite inputs. It accepts an infinite input sequence if there exists a run of the automaton that visits (at least) one of the final states infinitely often."
      ],
      "id": "en-Büchi_automaton-en-noun-5IJ2m8l-",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "ω-automaton",
          "ω-automaton"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "input",
          "input"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A type of ω-automaton that extends a finite automaton to infinite inputs. It accepts an infinite input sequence if there exists a run of the automaton that visits (at least) one of the final states infinitely often."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Büchi automaton"
      ]
    }
  ],
  "word": "Büchi automaton"
}

{
  "etymology_text": "Named after the Swiss mathematician Julius Richard Büchi, who invented this kind of automaton in 1962.",
  "forms": [
    {
      "form": "Büchi automatons",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "Büchi automata",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "s",
        "2": "Büchi automata"
      },
      "expansion": "Büchi automaton (plural Büchi automatons or Büchi automata)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms spelled with Ü",
        "English terms spelled with ◌̈",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "glosses": [
        "A type of ω-automaton that extends a finite automaton to infinite inputs. It accepts an infinite input sequence if there exists a run of the automaton that visits (at least) one of the final states infinitely often."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "ω-automaton",
          "ω-automaton"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "infinite",
          "infinite"
        ],
        [
          "input",
          "input"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A type of ω-automaton that extends a finite automaton to infinite inputs. It accepts an infinite input sequence if there exists a run of the automaton that visits (at least) one of the final states infinitely often."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Büchi automaton"
      ]
    }
  ],
  "word": "Büchi automaton"
}