Büchi automaton
AUTOMATON WHICH EITHER ACCEPTS OR REJECTS INFINITE INPUTS
Buechi automaton; Buchi automata; Buchi automaton; Büchi automata; Buechi automata
In computer science and automata theory, a deterministic Büchi automaton is a theoretical machine which either accepts or rejects infinite inputs. Such a machine has a set of states and a transition function, which determines which state the machine should move to from its current state when it reads the next input character.