weak Büchi automaton

Weak Büchi automaton - Wikipedia

In computer science and automata theory, a Weak Büchi automaton is a formalism which represents a set of infinite words. A Weak Büchi automaton is a modification of Büchi automaton such that for all pair of states q and q′ belonging to the same strongly connected component, q is accepting if and only if q′ is accepting.

A Büchi automaton accepts a word w if there exists a run, such that at least one state occurring infinitely often in the final state set F . For Weak Büchi automata, this condition is equivalent to the existence of a run which ultimately stays in the set of accepting states.

Weak Büchi automata are strictly less-expressive than Büchi automaton and than Co-Büchi automaton.