In computer science and automata theory, a Büchi automaton is a type of ω-automaton, which extends a finite automaton to infinite inputs. It accepts an infinite input sequence iff there exists a run of the automaton that visits (at least) one of the final states infinitely often. Büchi automata recognize the omega-regular languages, the infinite word version of regular languages. It is named after the Swiss mathematician Julius Richard Büchi who invented this kind of automaton in 1962.
Büchi automata are often used in Model checking as an automata-theoretic version of a formula in linear temporal logic.
Read more about Büchi Automaton: Formal Definition, Closure Properties, Recognizable Languages, Algorithms, Variants, Transforming From Other Models of Description To Non-deterministic Büchi Automata